./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.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 440f273968b34677cc4ba81db9f48373d3cac4b8a75ac1f970ae3fdbbff89c17 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 13:02:11,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 13:02:11,908 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 13:02:11,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 13:02:11,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 13:02:11,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 13:02:11,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 13:02:11,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 13:02:11,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 13:02:11,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 13:02:11,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 13:02:11,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 13:02:11,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 13:02:11,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 13:02:11,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 13:02:11,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 13:02:11,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 13:02:11,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 13:02:11,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 13:02:11,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 13:02:11,990 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 13:02:11,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 13:02:11,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 13:02:11,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 13:02:11,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 13:02:11,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 13:02:11,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 13:02:11,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 13:02:12,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 13:02:12,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 13:02:12,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 13:02:12,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 13:02:12,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 13:02:12,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 13:02:12,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 13:02:12,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 13:02:12,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 13:02:12,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 13:02:12,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 13:02:12,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 13:02:12,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 13:02:12,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 13:02:12,011 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 13:02:12,046 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 13:02:12,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 13:02:12,047 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 13:02:12,047 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 13:02:12,048 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 13:02:12,048 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 13:02:12,049 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 13:02:12,049 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 13:02:12,049 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 13:02:12,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 13:02:12,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 13:02:12,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 13:02:12,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 13:02:12,051 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 13:02:12,051 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 13:02:12,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 13:02:12,051 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 13:02:12,052 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 13:02:12,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 13:02:12,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 13:02:12,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 13:02:12,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:02:12,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 13:02:12,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 13:02:12,054 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 13:02:12,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 13:02:12,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 13:02:12,054 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 13:02:12,055 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 13:02:12,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 13:02:12,055 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 -> 440f273968b34677cc4ba81db9f48373d3cac4b8a75ac1f970ae3fdbbff89c17 [2022-07-12 13:02:12,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 13:02:12,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 13:02:12,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 13:02:12,331 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 13:02:12,332 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 13:02:12,333 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2022-07-12 13:02:12,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549b2536a/87cc83e1dd9b4d3ab268a7b9e54e9d5b/FLAG2c9453cb2 [2022-07-12 13:02:12,960 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 13:02:12,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2022-07-12 13:02:12,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549b2536a/87cc83e1dd9b4d3ab268a7b9e54e9d5b/FLAG2c9453cb2 [2022-07-12 13:02:13,407 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549b2536a/87cc83e1dd9b4d3ab268a7b9e54e9d5b [2022-07-12 13:02:13,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 13:02:13,410 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 13:02:13,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 13:02:13,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 13:02:13,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 13:02:13,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:02:13" (1/1) ... [2022-07-12 13:02:13,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ddd601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:13, skipping insertion in model container [2022-07-12 13:02:13,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:02:13" (1/1) ... [2022-07-12 13:02:13,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 13:02:13,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 13:02:13,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i[49178,49191] [2022-07-12 13:02:14,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:02:14,068 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 13:02:14,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i[49178,49191] [2022-07-12 13:02:14,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:02:14,259 INFO L208 MainTranslator]: Completed translation [2022-07-12 13:02:14,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:14 WrapperNode [2022-07-12 13:02:14,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 13:02:14,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 13:02:14,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 13:02:14,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 13:02:14,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:14" (1/1) ... [2022-07-12 13:02:14,307 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:14" (1/1) ... [2022-07-12 13:02:14,366 INFO L137 Inliner]: procedures = 117, calls = 360, calls flagged for inlining = 51, calls inlined = 35, statements flattened = 863 [2022-07-12 13:02:14,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 13:02:14,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 13:02:14,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 13:02:14,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 13:02:14,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:14" (1/1) ... [2022-07-12 13:02:14,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:14" (1/1) ... [2022-07-12 13:02:14,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:14" (1/1) ... [2022-07-12 13:02:14,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:14" (1/1) ... [2022-07-12 13:02:14,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:14" (1/1) ... [2022-07-12 13:02:14,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:14" (1/1) ... [2022-07-12 13:02:14,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:14" (1/1) ... [2022-07-12 13:02:14,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 13:02:14,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 13:02:14,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 13:02:14,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 13:02:14,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:14" (1/1) ... [2022-07-12 13:02:14,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:02:14,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:02:14,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 13:02:14,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 13:02:14,571 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-12 13:02:14,571 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-12 13:02:14,571 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 13:02:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 13:02:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 13:02:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_time_to_tm [2022-07-12 13:02:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_time_to_tm [2022-07-12 13:02:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_proc [2022-07-12 13:02:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_proc [2022-07-12 13:02:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2022-07-12 13:02:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2022-07-12 13:02:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure outer_sync [2022-07-12 13:02:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure outer_sync [2022-07-12 13:02:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_remove [2022-07-12 13:02:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_remove [2022-07-12 13:02:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_shutdown [2022-07-12 13:02:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_shutdown [2022-07-12 13:02:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 13:02:14,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 13:02:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_tm_to_time [2022-07-12 13:02:14,574 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_tm_to_time [2022-07-12 13:02:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-12 13:02:14,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-12 13:02:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 13:02:14,575 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 13:02:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_alarm [2022-07-12 13:02:14,575 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_alarm [2022-07-12 13:02:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 13:02:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 13:02:14,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 13:02:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_check [2022-07-12 13:02:14,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_check [2022-07-12 13:02:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_alarm_irq_enable [2022-07-12 13:02:14,576 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_alarm_irq_enable [2022-07-12 13:02:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_iounmap [2022-07-12 13:02:14,576 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_iounmap [2022-07-12 13:02:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 13:02:14,577 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 13:02:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 13:02:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 13:02:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_device_unregister [2022-07-12 13:02:14,577 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_device_unregister [2022-07-12 13:02:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 13:02:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-07-12 13:02:14,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-07-12 13:02:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 13:02:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 13:02:14,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 13:02:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2022-07-12 13:02:14,579 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2022-07-12 13:02:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-12 13:02:14,579 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-12 13:02:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-12 13:02:14,580 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-12 13:02:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 13:02:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2022-07-12 13:02:14,581 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2022-07-12 13:02:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 13:02:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-07-12 13:02:14,582 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-07-12 13:02:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_read_time [2022-07-12 13:02:14,583 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_read_time [2022-07-12 13:02:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_wait_while_busy [2022-07-12 13:02:14,583 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_wait_while_busy [2022-07-12 13:02:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 13:02:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-12 13:02:14,584 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-12 13:02:14,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 13:02:14,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 13:02:14,584 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_time [2022-07-12 13:02:14,584 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_time [2022-07-12 13:02:14,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 13:02:14,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 13:02:14,813 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 13:02:14,815 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 13:02:15,081 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 13:02:15,667 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 13:02:15,680 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 13:02:15,683 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 13:02:15,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:02:15 BoogieIcfgContainer [2022-07-12 13:02:15,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 13:02:15,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 13:02:15,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 13:02:15,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 13:02:15,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 01:02:13" (1/3) ... [2022-07-12 13:02:15,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766237f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:02:15, skipping insertion in model container [2022-07-12 13:02:15,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:14" (2/3) ... [2022-07-12 13:02:15,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766237f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:02:15, skipping insertion in model container [2022-07-12 13:02:15,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:02:15" (3/3) ... [2022-07-12 13:02:15,697 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2022-07-12 13:02:15,761 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 13:02:15,767 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 13:02:15,855 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 13:02:15,862 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c04b54d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5319034f [2022-07-12 13:02:15,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 13:02:15,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 399 states, 288 states have (on average 1.375) internal successors, (396), 298 states have internal predecessors, (396), 79 states have call successors, (79), 31 states have call predecessors, (79), 30 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2022-07-12 13:02:15,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 13:02:15,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:15,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:02:15,884 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:15,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:15,889 INFO L85 PathProgramCache]: Analyzing trace with hash 863061951, now seen corresponding path program 1 times [2022-07-12 13:02:15,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:15,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362871994] [2022-07-12 13:02:15,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:15,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:16,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:02:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:16,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 13:02:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:16,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:16,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 13:02:16,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:02:16,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362871994] [2022-07-12 13:02:16,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362871994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:16,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:02:16,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:02:16,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905324808] [2022-07-12 13:02:16,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:16,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:02:16,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:02:16,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:02:16,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:02:16,361 INFO L87 Difference]: Start difference. First operand has 399 states, 288 states have (on average 1.375) internal successors, (396), 298 states have internal predecessors, (396), 79 states have call successors, (79), 31 states have call predecessors, (79), 30 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 13:02:16,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:16,913 INFO L93 Difference]: Finished difference Result 776 states and 1124 transitions. [2022-07-12 13:02:16,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 13:02:16,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-07-12 13:02:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:16,928 INFO L225 Difference]: With dead ends: 776 [2022-07-12 13:02:16,929 INFO L226 Difference]: Without dead ends: 367 [2022-07-12 13:02:16,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:02:16,939 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 544 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:16,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 747 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 13:02:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-07-12 13:02:16,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 277. [2022-07-12 13:02:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 205 states have (on average 1.2829268292682927) internal successors, (263), 206 states have internal predecessors, (263), 48 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2022-07-12 13:02:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 358 transitions. [2022-07-12 13:02:17,001 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 358 transitions. Word has length 39 [2022-07-12 13:02:17,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:17,001 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 358 transitions. [2022-07-12 13:02:17,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 13:02:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 358 transitions. [2022-07-12 13:02:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 13:02:17,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:17,006 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 13:02:17,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 13:02:17,007 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:17,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:17,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1622348299, now seen corresponding path program 1 times [2022-07-12 13:02:17,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:17,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297552141] [2022-07-12 13:02:17,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:17,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:17,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:02:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:17,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 13:02:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:17,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:17,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:02:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:17,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:17,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 13:02:17,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:02:17,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297552141] [2022-07-12 13:02:17,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297552141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:17,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:02:17,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:02:17,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128858249] [2022-07-12 13:02:17,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:17,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:02:17,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:02:17,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:02:17,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:02:17,162 INFO L87 Difference]: Start difference. First operand 277 states and 358 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 13:02:17,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:17,893 INFO L93 Difference]: Finished difference Result 796 states and 1053 transitions. [2022-07-12 13:02:17,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:02:17,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-12 13:02:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:17,899 INFO L225 Difference]: With dead ends: 796 [2022-07-12 13:02:17,900 INFO L226 Difference]: Without dead ends: 526 [2022-07-12 13:02:17,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:02:17,902 INFO L413 NwaCegarLoop]: 382 mSDtfsCounter, 386 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:17,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 896 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 13:02:17,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-12 13:02:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 395. [2022-07-12 13:02:17,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 297 states have (on average 1.2861952861952861) internal successors, (382), 299 states have internal predecessors, (382), 65 states have call successors, (65), 33 states have call predecessors, (65), 32 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-07-12 13:02:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 511 transitions. [2022-07-12 13:02:17,943 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 511 transitions. Word has length 57 [2022-07-12 13:02:17,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:17,943 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 511 transitions. [2022-07-12 13:02:17,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 13:02:17,944 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 511 transitions. [2022-07-12 13:02:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 13:02:17,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:17,948 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 13:02:17,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 13:02:17,948 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:17,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:17,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1789312131, now seen corresponding path program 1 times [2022-07-12 13:02:17,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:17,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400202467] [2022-07-12 13:02:17,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:17,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:18,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:02:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:18,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 13:02:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:18,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:18,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:02:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:18,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:18,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 13:02:18,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:02:18,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400202467] [2022-07-12 13:02:18,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400202467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:18,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:02:18,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:02:18,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145157981] [2022-07-12 13:02:18,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:18,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:02:18,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:02:18,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:02:18,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:02:18,076 INFO L87 Difference]: Start difference. First operand 395 states and 511 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 13:02:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:18,773 INFO L93 Difference]: Finished difference Result 917 states and 1213 transitions. [2022-07-12 13:02:18,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 13:02:18,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 58 [2022-07-12 13:02:18,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:18,778 INFO L225 Difference]: With dead ends: 917 [2022-07-12 13:02:18,778 INFO L226 Difference]: Without dead ends: 539 [2022-07-12 13:02:18,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-12 13:02:18,781 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 524 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:18,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1112 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 13:02:18,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-07-12 13:02:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 405. [2022-07-12 13:02:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 305 states have (on average 1.2754098360655737) internal successors, (389), 307 states have internal predecessors, (389), 65 states have call successors, (65), 35 states have call predecessors, (65), 34 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-07-12 13:02:18,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 518 transitions. [2022-07-12 13:02:18,838 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 518 transitions. Word has length 58 [2022-07-12 13:02:18,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:18,839 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 518 transitions. [2022-07-12 13:02:18,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 13:02:18,839 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 518 transitions. [2022-07-12 13:02:18,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 13:02:18,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:18,842 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 13:02:18,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 13:02:18,843 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:18,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:18,843 INFO L85 PathProgramCache]: Analyzing trace with hash 967197344, now seen corresponding path program 1 times [2022-07-12 13:02:18,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:18,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602889536] [2022-07-12 13:02:18,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:18,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:18,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:02:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:18,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 13:02:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:18,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:18,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 13:02:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:18,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:18,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 13:02:18,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:02:18,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602889536] [2022-07-12 13:02:18,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602889536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:18,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:02:18,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:02:18,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243341118] [2022-07-12 13:02:18,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:18,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:02:18,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:02:18,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:02:18,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:02:18,950 INFO L87 Difference]: Start difference. First operand 405 states and 518 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 13:02:19,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:19,438 INFO L93 Difference]: Finished difference Result 937 states and 1222 transitions. [2022-07-12 13:02:19,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 13:02:19,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 56 [2022-07-12 13:02:19,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:19,442 INFO L225 Difference]: With dead ends: 937 [2022-07-12 13:02:19,442 INFO L226 Difference]: Without dead ends: 549 [2022-07-12 13:02:19,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-12 13:02:19,445 INFO L413 NwaCegarLoop]: 364 mSDtfsCounter, 659 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:19,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 985 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 13:02:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-07-12 13:02:19,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 415. [2022-07-12 13:02:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 313 states have (on average 1.2651757188498403) internal successors, (396), 315 states have internal predecessors, (396), 65 states have call successors, (65), 37 states have call predecessors, (65), 36 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-07-12 13:02:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 525 transitions. [2022-07-12 13:02:19,473 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 525 transitions. Word has length 56 [2022-07-12 13:02:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:19,473 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 525 transitions. [2022-07-12 13:02:19,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 13:02:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 525 transitions. [2022-07-12 13:02:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 13:02:19,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:19,476 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 13:02:19,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 13:02:19,476 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:19,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash 118188198, now seen corresponding path program 1 times [2022-07-12 13:02:19,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:19,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57850789] [2022-07-12 13:02:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:19,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:19,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:02:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:19,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 13:02:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:19,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:19,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 13:02:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:19,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:19,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 13:02:19,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:02:19,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57850789] [2022-07-12 13:02:19,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57850789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:19,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:02:19,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:02:19,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250003909] [2022-07-12 13:02:19,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:19,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:02:19,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:02:19,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:02:19,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:02:19,592 INFO L87 Difference]: Start difference. First operand 415 states and 525 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 13:02:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:20,422 INFO L93 Difference]: Finished difference Result 1487 states and 1927 transitions. [2022-07-12 13:02:20,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 13:02:20,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2022-07-12 13:02:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:20,429 INFO L225 Difference]: With dead ends: 1487 [2022-07-12 13:02:20,429 INFO L226 Difference]: Without dead ends: 1089 [2022-07-12 13:02:20,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-07-12 13:02:20,432 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 951 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:20,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 1304 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 13:02:20,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2022-07-12 13:02:20,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 805. [2022-07-12 13:02:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 608 states have (on average 1.269736842105263) internal successors, (772), 617 states have internal predecessors, (772), 122 states have call successors, (122), 70 states have call predecessors, (122), 74 states have return successors, (138), 121 states have call predecessors, (138), 121 states have call successors, (138) [2022-07-12 13:02:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1032 transitions. [2022-07-12 13:02:20,476 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1032 transitions. Word has length 55 [2022-07-12 13:02:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:20,477 INFO L495 AbstractCegarLoop]: Abstraction has 805 states and 1032 transitions. [2022-07-12 13:02:20,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 13:02:20,477 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1032 transitions. [2022-07-12 13:02:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 13:02:20,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:20,479 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 13:02:20,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 13:02:20,479 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:20,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:20,480 INFO L85 PathProgramCache]: Analyzing trace with hash -943497047, now seen corresponding path program 1 times [2022-07-12 13:02:20,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:20,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651265337] [2022-07-12 13:02:20,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:20,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:20,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:02:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:20,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 13:02:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:20,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:20,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:02:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:20,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:20,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 13:02:20,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:02:20,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651265337] [2022-07-12 13:02:20,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651265337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:20,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:02:20,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:02:20,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059915551] [2022-07-12 13:02:20,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:20,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:02:20,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:02:20,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:02:20,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:02:20,626 INFO L87 Difference]: Start difference. First operand 805 states and 1032 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 13:02:21,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:21,181 INFO L93 Difference]: Finished difference Result 1705 states and 2210 transitions. [2022-07-12 13:02:21,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 13:02:21,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2022-07-12 13:02:21,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:21,187 INFO L225 Difference]: With dead ends: 1705 [2022-07-12 13:02:21,188 INFO L226 Difference]: Without dead ends: 917 [2022-07-12 13:02:21,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-12 13:02:21,192 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 661 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:21,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 933 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 13:02:21,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2022-07-12 13:02:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 719. [2022-07-12 13:02:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 543 states have (on average 1.2615101289134438) internal successors, (685), 548 states have internal predecessors, (685), 106 states have call successors, (106), 65 states have call predecessors, (106), 69 states have return successors, (121), 107 states have call predecessors, (121), 105 states have call successors, (121) [2022-07-12 13:02:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 912 transitions. [2022-07-12 13:02:21,236 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 912 transitions. Word has length 57 [2022-07-12 13:02:21,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:21,236 INFO L495 AbstractCegarLoop]: Abstraction has 719 states and 912 transitions. [2022-07-12 13:02:21,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 13:02:21,237 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 912 transitions. [2022-07-12 13:02:21,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-12 13:02:21,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:21,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:02:21,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 13:02:21,245 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:21,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:21,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1665561776, now seen corresponding path program 1 times [2022-07-12 13:02:21,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:21,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359158127] [2022-07-12 13:02:21,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:21,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:21,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:02:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:21,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 13:02:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:21,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 13:02:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:21,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:21,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 13:02:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:21,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:21,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 13:02:21,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:02:21,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359158127] [2022-07-12 13:02:21,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359158127] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:02:21,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520637609] [2022-07-12 13:02:21,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:21,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:02:21,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:02:21,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:02:21,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 13:02:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:21,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 13:02:21,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:02:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 13:02:21,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:02:21,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520637609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:21,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:02:21,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-07-12 13:02:21,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544317826] [2022-07-12 13:02:21,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:21,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:02:21,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:02:21,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:02:21,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-12 13:02:21,771 INFO L87 Difference]: Start difference. First operand 719 states and 912 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 13:02:21,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:21,961 INFO L93 Difference]: Finished difference Result 1747 states and 2216 transitions. [2022-07-12 13:02:21,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 13:02:21,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 67 [2022-07-12 13:02:21,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:21,969 INFO L225 Difference]: With dead ends: 1747 [2022-07-12 13:02:21,969 INFO L226 Difference]: Without dead ends: 1052 [2022-07-12 13:02:21,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2022-07-12 13:02:21,972 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 337 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:21,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 2357 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 13:02:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-07-12 13:02:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1005. [2022-07-12 13:02:22,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 763 states have (on average 1.2699868938401049) internal successors, (969), 770 states have internal predecessors, (969), 146 states have call successors, (146), 89 states have call predecessors, (146), 95 states have return successors, (166), 147 states have call predecessors, (166), 145 states have call successors, (166) [2022-07-12 13:02:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1281 transitions. [2022-07-12 13:02:22,026 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1281 transitions. Word has length 67 [2022-07-12 13:02:22,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:22,027 INFO L495 AbstractCegarLoop]: Abstraction has 1005 states and 1281 transitions. [2022-07-12 13:02:22,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 13:02:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1281 transitions. [2022-07-12 13:02:22,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 13:02:22,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:22,030 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 13:02:22,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 13:02:22,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:02:22,244 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:22,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:22,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2022790021, now seen corresponding path program 1 times [2022-07-12 13:02:22,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:22,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090078285] [2022-07-12 13:02:22,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:22,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:22,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:02:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:22,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 13:02:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:22,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 13:02:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:22,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:22,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 13:02:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:22,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:22,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:22,407 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 13:02:22,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:02:22,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090078285] [2022-07-12 13:02:22,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090078285] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:02:22,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869684157] [2022-07-12 13:02:22,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:22,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:02:22,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:02:22,409 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:02:22,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 13:02:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:22,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 13:02:22,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:02:22,703 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 13:02:22,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:02:22,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869684157] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:22,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:02:22,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-12 13:02:22,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451005161] [2022-07-12 13:02:22,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:22,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:02:22,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:02:22,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:02:22,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-12 13:02:22,705 INFO L87 Difference]: Start difference. First operand 1005 states and 1281 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 13:02:22,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:22,911 INFO L93 Difference]: Finished difference Result 2325 states and 2960 transitions. [2022-07-12 13:02:22,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 13:02:22,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2022-07-12 13:02:22,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:22,918 INFO L225 Difference]: With dead ends: 2325 [2022-07-12 13:02:22,918 INFO L226 Difference]: Without dead ends: 1344 [2022-07-12 13:02:22,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-07-12 13:02:22,923 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 337 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:22,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 2378 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 13:02:22,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2022-07-12 13:02:22,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1289. [2022-07-12 13:02:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 981 states have (on average 1.275229357798165) internal successors, (1251), 992 states have internal predecessors, (1251), 186 states have call successors, (186), 113 states have call predecessors, (186), 121 states have return successors, (211), 185 states have call predecessors, (211), 185 states have call successors, (211) [2022-07-12 13:02:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1648 transitions. [2022-07-12 13:02:22,986 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1648 transitions. Word has length 68 [2022-07-12 13:02:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:22,987 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1648 transitions. [2022-07-12 13:02:22,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 13:02:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1648 transitions. [2022-07-12 13:02:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 13:02:22,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:22,990 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 13:02:23,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 13:02:23,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-07-12 13:02:23,216 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:23,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:23,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2110117865, now seen corresponding path program 1 times [2022-07-12 13:02:23,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:23,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536902526] [2022-07-12 13:02:23,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:23,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:23,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:02:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:23,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 13:02:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:23,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:02:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:23,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:23,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 13:02:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:23,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:23,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 13:02:23,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:02:23,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536902526] [2022-07-12 13:02:23,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536902526] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:02:23,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946423850] [2022-07-12 13:02:23,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:23,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:02:23,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:02:23,388 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:02:23,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 13:02:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:23,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 13:02:23,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:02:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 13:02:23,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:02:23,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946423850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:23,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:02:23,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-12 13:02:23,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457725829] [2022-07-12 13:02:23,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:23,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:02:23,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:02:23,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:02:23,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-12 13:02:23,688 INFO L87 Difference]: Start difference. First operand 1289 states and 1648 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 13:02:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:23,913 INFO L93 Difference]: Finished difference Result 2893 states and 3694 transitions. [2022-07-12 13:02:23,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 13:02:23,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 69 [2022-07-12 13:02:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:23,921 INFO L225 Difference]: With dead ends: 2893 [2022-07-12 13:02:23,922 INFO L226 Difference]: Without dead ends: 1628 [2022-07-12 13:02:23,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-07-12 13:02:23,927 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 337 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:23,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 2378 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 13:02:23,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2022-07-12 13:02:23,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1289. [2022-07-12 13:02:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 981 states have (on average 1.275229357798165) internal successors, (1251), 992 states have internal predecessors, (1251), 186 states have call successors, (186), 113 states have call predecessors, (186), 121 states have return successors, (211), 185 states have call predecessors, (211), 185 states have call successors, (211) [2022-07-12 13:02:24,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1648 transitions. [2022-07-12 13:02:24,002 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1648 transitions. Word has length 69 [2022-07-12 13:02:24,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:24,002 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1648 transitions. [2022-07-12 13:02:24,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 13:02:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1648 transitions. [2022-07-12 13:02:24,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 13:02:24,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:24,005 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 13:02:24,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 13:02:24,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:02:24,216 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:24,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:24,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1874499426, now seen corresponding path program 1 times [2022-07-12 13:02:24,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:24,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345855429] [2022-07-12 13:02:24,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:24,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:24,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:02:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:02:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:24,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 13:02:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:24,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:24,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 13:02:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:24,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:24,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 13:02:24,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:02:24,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345855429] [2022-07-12 13:02:24,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345855429] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:02:24,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129401416] [2022-07-12 13:02:24,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:24,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:02:24,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:02:24,350 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:02:24,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 13:02:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:24,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 13:02:24,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:02:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 13:02:24,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:02:24,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129401416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:24,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:02:24,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-12 13:02:24,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359686701] [2022-07-12 13:02:24,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:24,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:02:24,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:02:24,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:02:24,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-12 13:02:24,632 INFO L87 Difference]: Start difference. First operand 1289 states and 1648 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 13:02:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:24,838 INFO L93 Difference]: Finished difference Result 2893 states and 3694 transitions. [2022-07-12 13:02:24,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 13:02:24,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2022-07-12 13:02:24,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:24,848 INFO L225 Difference]: With dead ends: 2893 [2022-07-12 13:02:24,849 INFO L226 Difference]: Without dead ends: 1628 [2022-07-12 13:02:24,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-07-12 13:02:24,854 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 337 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:24,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 2323 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 13:02:24,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2022-07-12 13:02:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1289. [2022-07-12 13:02:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 981 states have (on average 1.275229357798165) internal successors, (1251), 992 states have internal predecessors, (1251), 186 states have call successors, (186), 113 states have call predecessors, (186), 121 states have return successors, (211), 185 states have call predecessors, (211), 185 states have call successors, (211) [2022-07-12 13:02:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1648 transitions. [2022-07-12 13:02:24,950 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1648 transitions. Word has length 70 [2022-07-12 13:02:24,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:24,951 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1648 transitions. [2022-07-12 13:02:24,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 13:02:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1648 transitions. [2022-07-12 13:02:24,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-12 13:02:24,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:24,954 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:02:24,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 13:02:25,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:02:25,168 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:25,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash -628405765, now seen corresponding path program 1 times [2022-07-12 13:02:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:25,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138481950] [2022-07-12 13:02:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:25,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:25,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:02:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:25,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 13:02:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:25,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 13:02:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:25,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:25,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 13:02:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:25,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:25,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 13:02:25,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:02:25,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138481950] [2022-07-12 13:02:25,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138481950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:25,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:02:25,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:02:25,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337925320] [2022-07-12 13:02:25,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:25,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:02:25,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:02:25,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:02:25,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:02:25,252 INFO L87 Difference]: Start difference. First operand 1289 states and 1648 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 13:02:25,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:25,766 INFO L93 Difference]: Finished difference Result 3232 states and 4215 transitions. [2022-07-12 13:02:25,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:02:25,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 75 [2022-07-12 13:02:25,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:25,779 INFO L225 Difference]: With dead ends: 3232 [2022-07-12 13:02:25,779 INFO L226 Difference]: Without dead ends: 1967 [2022-07-12 13:02:25,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:02:25,784 INFO L413 NwaCegarLoop]: 525 mSDtfsCounter, 458 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:25,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1005 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 13:02:25,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2022-07-12 13:02:25,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1610. [2022-07-12 13:02:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1263 states have (on average 1.2866191607284243) internal successors, (1625), 1279 states have internal predecessors, (1625), 203 states have call successors, (203), 133 states have call predecessors, (203), 143 states have return successors, (230), 200 states have call predecessors, (230), 202 states have call successors, (230) [2022-07-12 13:02:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2058 transitions. [2022-07-12 13:02:25,865 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2058 transitions. Word has length 75 [2022-07-12 13:02:25,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:25,865 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2058 transitions. [2022-07-12 13:02:25,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 13:02:25,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2058 transitions. [2022-07-12 13:02:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 13:02:25,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:25,892 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:02:25,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 13:02:25,893 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:25,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:25,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1055310527, now seen corresponding path program 1 times [2022-07-12 13:02:25,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:25,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891136624] [2022-07-12 13:02:25,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:25,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:25,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:02:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:25,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 13:02:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:26,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 13:02:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:26,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 13:02:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:26,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:26,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 13:02:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:26,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:26,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 13:02:26,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:02:26,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891136624] [2022-07-12 13:02:26,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891136624] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:02:26,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795716118] [2022-07-12 13:02:26,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:26,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:02:26,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:02:26,071 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:02:26,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 13:02:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:26,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 13:02:26,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:02:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 13:02:26,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:02:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 13:02:26,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795716118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 13:02:26,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 13:02:26,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2022-07-12 13:02:26,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384098115] [2022-07-12 13:02:26,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 13:02:26,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 13:02:26,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:02:26,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 13:02:26,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-07-12 13:02:26,667 INFO L87 Difference]: Start difference. First operand 1610 states and 2058 transitions. Second operand has 22 states, 22 states have (on average 5.045454545454546) internal successors, (111), 15 states have internal predecessors, (111), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-12 13:02:30,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:30,853 INFO L93 Difference]: Finished difference Result 4116 states and 5283 transitions. [2022-07-12 13:02:30,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-12 13:02:30,854 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.045454545454546) internal successors, (111), 15 states have internal predecessors, (111), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 82 [2022-07-12 13:02:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:30,867 INFO L225 Difference]: With dead ends: 4116 [2022-07-12 13:02:30,867 INFO L226 Difference]: Without dead ends: 2509 [2022-07-12 13:02:30,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=657, Invalid=2649, Unknown=0, NotChecked=0, Total=3306 [2022-07-12 13:02:30,873 INFO L413 NwaCegarLoop]: 500 mSDtfsCounter, 2023 mSDsluCounter, 2879 mSDsCounter, 0 mSdLazyCounter, 4792 mSolverCounterSat, 895 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2052 SdHoareTripleChecker+Valid, 3379 SdHoareTripleChecker+Invalid, 5687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 895 IncrementalHoareTripleChecker+Valid, 4792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:30,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2052 Valid, 3379 Invalid, 5687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [895 Valid, 4792 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-12 13:02:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2022-07-12 13:02:30,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 1918. [2022-07-12 13:02:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1509 states have (on average 1.291583830351226) internal successors, (1949), 1525 states have internal predecessors, (1949), 241 states have call successors, (241), 157 states have call predecessors, (241), 167 states have return successors, (268), 238 states have call predecessors, (268), 240 states have call successors, (268) [2022-07-12 13:02:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2458 transitions. [2022-07-12 13:02:30,983 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2458 transitions. Word has length 82 [2022-07-12 13:02:30,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:30,984 INFO L495 AbstractCegarLoop]: Abstraction has 1918 states and 2458 transitions. [2022-07-12 13:02:30,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.045454545454546) internal successors, (111), 15 states have internal predecessors, (111), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-12 13:02:30,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2458 transitions. [2022-07-12 13:02:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 13:02:30,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:30,987 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:02:31,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 13:02:31,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 13:02:31,204 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:31,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:31,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1436141603, now seen corresponding path program 1 times [2022-07-12 13:02:31,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:31,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480742092] [2022-07-12 13:02:31,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:31,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:31,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:02:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:31,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 13:02:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:31,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 13:02:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:31,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 13:02:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:31,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:31,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 13:02:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:31,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:31,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:31,358 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 13:02:31,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:02:31,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480742092] [2022-07-12 13:02:31,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480742092] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:02:31,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408305651] [2022-07-12 13:02:31,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:31,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:02:31,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:02:31,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:02:31,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 13:02:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:31,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 13:02:31,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:02:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 13:02:31,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:02:31,910 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 13:02:31,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408305651] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 13:02:31,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 13:02:31,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2022-07-12 13:02:31,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102828956] [2022-07-12 13:02:31,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 13:02:31,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 13:02:31,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:02:31,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 13:02:31,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-07-12 13:02:31,912 INFO L87 Difference]: Start difference. First operand 1918 states and 2458 transitions. Second operand has 22 states, 22 states have (on average 5.136363636363637) internal successors, (113), 15 states have internal predecessors, (113), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-12 13:02:36,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:36,031 INFO L93 Difference]: Finished difference Result 4819 states and 6199 transitions. [2022-07-12 13:02:36,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-12 13:02:36,032 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.136363636363637) internal successors, (113), 15 states have internal predecessors, (113), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 83 [2022-07-12 13:02:36,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:36,046 INFO L225 Difference]: With dead ends: 4819 [2022-07-12 13:02:36,046 INFO L226 Difference]: Without dead ends: 2904 [2022-07-12 13:02:36,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=657, Invalid=2649, Unknown=0, NotChecked=0, Total=3306 [2022-07-12 13:02:36,053 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 2030 mSDsluCounter, 3290 mSDsCounter, 0 mSdLazyCounter, 5319 mSolverCounterSat, 889 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2058 SdHoareTripleChecker+Valid, 3796 SdHoareTripleChecker+Invalid, 6208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 889 IncrementalHoareTripleChecker+Valid, 5319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:36,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2058 Valid, 3796 Invalid, 6208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [889 Valid, 5319 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-12 13:02:36,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2022-07-12 13:02:36,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1918. [2022-07-12 13:02:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1509 states have (on average 1.291583830351226) internal successors, (1949), 1525 states have internal predecessors, (1949), 241 states have call successors, (241), 157 states have call predecessors, (241), 167 states have return successors, (268), 238 states have call predecessors, (268), 240 states have call successors, (268) [2022-07-12 13:02:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2458 transitions. [2022-07-12 13:02:36,166 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2458 transitions. Word has length 83 [2022-07-12 13:02:36,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:36,167 INFO L495 AbstractCegarLoop]: Abstraction has 1918 states and 2458 transitions. [2022-07-12 13:02:36,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.136363636363637) internal successors, (113), 15 states have internal predecessors, (113), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-12 13:02:36,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2458 transitions. [2022-07-12 13:02:36,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 13:02:36,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:36,170 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:02:36,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 13:02:36,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:02:36,384 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:36,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:36,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1849722856, now seen corresponding path program 1 times [2022-07-12 13:02:36,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:36,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236375384] [2022-07-12 13:02:36,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:36,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:36,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:02:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:36,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:02:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:36,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 13:02:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:36,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 13:02:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:36,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:36,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 13:02:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:36,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:36,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 13:02:36,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:02:36,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236375384] [2022-07-12 13:02:36,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236375384] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:02:36,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479282101] [2022-07-12 13:02:36,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:36,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:02:36,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:02:36,581 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:02:36,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 13:02:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:36,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 13:02:36,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:02:36,926 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 13:02:36,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:02:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 13:02:37,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479282101] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 13:02:37,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 13:02:37,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2022-07-12 13:02:37,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347011558] [2022-07-12 13:02:37,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 13:02:37,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 13:02:37,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:02:37,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 13:02:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-07-12 13:02:37,110 INFO L87 Difference]: Start difference. First operand 1918 states and 2458 transitions. Second operand has 22 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 15 states have internal predecessors, (115), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-12 13:02:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:40,616 INFO L93 Difference]: Finished difference Result 3746 states and 4789 transitions. [2022-07-12 13:02:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-12 13:02:40,617 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 15 states have internal predecessors, (115), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 84 [2022-07-12 13:02:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:40,625 INFO L225 Difference]: With dead ends: 3746 [2022-07-12 13:02:40,625 INFO L226 Difference]: Without dead ends: 1831 [2022-07-12 13:02:40,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=602, Invalid=2260, Unknown=0, NotChecked=0, Total=2862 [2022-07-12 13:02:40,630 INFO L413 NwaCegarLoop]: 428 mSDtfsCounter, 1972 mSDsluCounter, 3005 mSDsCounter, 0 mSdLazyCounter, 4893 mSolverCounterSat, 893 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1998 SdHoareTripleChecker+Valid, 3433 SdHoareTripleChecker+Invalid, 5786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 893 IncrementalHoareTripleChecker+Valid, 4893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:40,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1998 Valid, 3433 Invalid, 5786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [893 Valid, 4893 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-12 13:02:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2022-07-12 13:02:40,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1082. [2022-07-12 13:02:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 851 states have (on average 1.2867215041128084) internal successors, (1095), 855 states have internal predecessors, (1095), 135 states have call successors, (135), 91 states have call predecessors, (135), 95 states have return successors, (150), 135 states have call predecessors, (150), 134 states have call successors, (150) [2022-07-12 13:02:40,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1380 transitions. [2022-07-12 13:02:40,690 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1380 transitions. Word has length 84 [2022-07-12 13:02:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:40,690 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 1380 transitions. [2022-07-12 13:02:40,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 15 states have internal predecessors, (115), 5 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-12 13:02:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1380 transitions. [2022-07-12 13:02:40,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 13:02:40,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:40,693 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:02:40,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 13:02:40,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:02:40,916 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:40,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:40,917 INFO L85 PathProgramCache]: Analyzing trace with hash -345111867, now seen corresponding path program 1 times [2022-07-12 13:02:40,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:40,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359257641] [2022-07-12 13:02:40,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:40,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:40,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:02:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:40,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 13:02:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:40,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 13:02:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:40,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:40,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 13:02:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:40,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:40,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:40,995 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 13:02:40,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:02:40,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359257641] [2022-07-12 13:02:40,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359257641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:40,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:02:40,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:02:40,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836932683] [2022-07-12 13:02:40,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:40,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:02:40,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:02:40,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:02:40,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:02:40,997 INFO L87 Difference]: Start difference. First operand 1082 states and 1380 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 13:02:41,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:41,524 INFO L93 Difference]: Finished difference Result 3120 states and 3980 transitions. [2022-07-12 13:02:41,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 13:02:41,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 88 [2022-07-12 13:02:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:41,533 INFO L225 Difference]: With dead ends: 3120 [2022-07-12 13:02:41,533 INFO L226 Difference]: Without dead ends: 2062 [2022-07-12 13:02:41,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:02:41,537 INFO L413 NwaCegarLoop]: 530 mSDtfsCounter, 416 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:41,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1183 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 13:02:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2022-07-12 13:02:41,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 1683. [2022-07-12 13:02:41,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1307 states have (on average 1.260902830910482) internal successors, (1648), 1313 states have internal predecessors, (1648), 207 states have call successors, (207), 159 states have call predecessors, (207), 168 states have return successors, (230), 210 states have call predecessors, (230), 206 states have call successors, (230) [2022-07-12 13:02:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2085 transitions. [2022-07-12 13:02:41,648 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2085 transitions. Word has length 88 [2022-07-12 13:02:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:41,648 INFO L495 AbstractCegarLoop]: Abstraction has 1683 states and 2085 transitions. [2022-07-12 13:02:41,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 13:02:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2085 transitions. [2022-07-12 13:02:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 13:02:41,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:41,652 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:02:41,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 13:02:41,653 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:41,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:41,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1624461571, now seen corresponding path program 1 times [2022-07-12 13:02:41,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:41,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791537] [2022-07-12 13:02:41,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:41,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:41,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:02:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:41,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 13:02:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:41,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 13:02:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:41,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:41,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 13:02:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:41,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:41,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 13:02:41,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:02:41,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791537] [2022-07-12 13:02:41,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:41,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:02:41,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 13:02:41,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120219660] [2022-07-12 13:02:41,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:41,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:02:41,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:02:41,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:02:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:02:41,779 INFO L87 Difference]: Start difference. First operand 1683 states and 2085 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 13:02:42,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:42,175 INFO L93 Difference]: Finished difference Result 3720 states and 4659 transitions. [2022-07-12 13:02:42,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 13:02:42,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 89 [2022-07-12 13:02:42,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:42,184 INFO L225 Difference]: With dead ends: 3720 [2022-07-12 13:02:42,184 INFO L226 Difference]: Without dead ends: 2060 [2022-07-12 13:02:42,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:02:42,189 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 116 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:42,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 938 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 13:02:42,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2022-07-12 13:02:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1684. [2022-07-12 13:02:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1308 states have (on average 1.260703363914373) internal successors, (1649), 1314 states have internal predecessors, (1649), 207 states have call successors, (207), 159 states have call predecessors, (207), 168 states have return successors, (230), 210 states have call predecessors, (230), 206 states have call successors, (230) [2022-07-12 13:02:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2086 transitions. [2022-07-12 13:02:42,291 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2086 transitions. Word has length 89 [2022-07-12 13:02:42,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:42,292 INFO L495 AbstractCegarLoop]: Abstraction has 1684 states and 2086 transitions. [2022-07-12 13:02:42,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 13:02:42,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2086 transitions. [2022-07-12 13:02:42,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-12 13:02:42,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:42,294 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:02:42,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 13:02:42,295 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:42,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:42,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1363223741, now seen corresponding path program 1 times [2022-07-12 13:02:42,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:42,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415560171] [2022-07-12 13:02:42,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:42,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:42,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:02:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:42,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 13:02:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:02:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:42,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:42,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 13:02:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:42,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:42,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:02:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:42,457 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 13:02:42,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:02:42,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415560171] [2022-07-12 13:02:42,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415560171] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:02:42,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994689019] [2022-07-12 13:02:42,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:42,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:02:42,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:02:42,464 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:02:42,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 13:02:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:42,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 13:02:42,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:02:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 13:02:42,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:02:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 13:02:42,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994689019] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 13:02:42,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 13:02:42,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-07-12 13:02:42,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416012491] [2022-07-12 13:02:42,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 13:02:42,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 13:02:42,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:02:42,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 13:02:42,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:02:42,763 INFO L87 Difference]: Start difference. First operand 1684 states and 2086 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 13:02:43,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:43,563 INFO L93 Difference]: Finished difference Result 3723 states and 4664 transitions. [2022-07-12 13:02:43,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:02:43,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2022-07-12 13:02:43,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:43,572 INFO L225 Difference]: With dead ends: 3723 [2022-07-12 13:02:43,573 INFO L226 Difference]: Without dead ends: 2063 [2022-07-12 13:02:43,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-12 13:02:43,577 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 221 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:43,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1530 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 13:02:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2022-07-12 13:02:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 1687. [2022-07-12 13:02:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1311 states have (on average 1.2601067887109076) internal successors, (1652), 1317 states have internal predecessors, (1652), 207 states have call successors, (207), 159 states have call predecessors, (207), 168 states have return successors, (230), 210 states have call predecessors, (230), 206 states have call successors, (230) [2022-07-12 13:02:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2089 transitions. [2022-07-12 13:02:43,685 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2089 transitions. Word has length 90 [2022-07-12 13:02:43,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:43,685 INFO L495 AbstractCegarLoop]: Abstraction has 1687 states and 2089 transitions. [2022-07-12 13:02:43,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 13:02:43,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2089 transitions. [2022-07-12 13:02:43,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-12 13:02:43,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:43,688 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:02:43,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 13:02:43,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 13:02:43,903 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:43,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:43,904 INFO L85 PathProgramCache]: Analyzing trace with hash -142119037, now seen corresponding path program 2 times [2022-07-12 13:02:43,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:02:43,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432389551] [2022-07-12 13:02:43,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:43,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:02:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 13:02:43,983 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 13:02:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 13:02:44,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 13:02:44,094 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 13:02:44,095 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 13:02:44,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 13:02:44,100 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:02:44,103 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 13:02:44,128 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,129 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,129 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,130 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,130 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,131 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,131 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,131 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,134 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,134 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,134 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,134 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,134 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,135 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,135 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,135 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,135 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,135 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,136 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,136 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,136 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,136 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,136 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,137 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,137 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,137 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,137 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,137 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,138 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,138 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,138 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,138 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,138 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,138 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,139 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,139 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,139 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,139 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,139 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,140 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,140 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,140 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,140 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,140 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,140 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,141 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,141 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,141 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,141 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,141 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,142 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,142 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,142 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,142 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,142 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,143 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,143 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,143 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,143 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,144 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,144 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,144 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,144 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,144 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,144 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,145 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,145 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,145 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,145 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,145 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,146 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,146 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,146 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,146 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,146 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,146 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,147 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,147 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,147 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,147 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,147 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,147 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,148 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,148 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,148 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,148 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,148 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,148 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,149 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,149 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,149 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,149 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,149 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,150 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,150 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,150 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,150 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,150 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,150 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,151 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,151 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,151 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,151 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,151 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,152 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,152 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,153 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,154 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,155 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,155 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,155 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,155 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,155 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,156 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,156 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,156 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,156 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,156 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,157 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,157 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,157 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,157 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,157 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,157 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,158 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,158 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,158 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,158 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,158 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,159 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,159 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,159 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,159 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,159 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,160 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,160 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,160 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,160 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,160 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,160 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,162 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,162 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,163 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,163 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,163 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,163 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,163 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,163 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,164 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,164 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,164 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,164 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,164 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,165 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,165 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,165 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,165 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,165 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:02:44,166 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,166 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:02:44,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 01:02:44 BoogieIcfgContainer [2022-07-12 13:02:44,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 13:02:44,258 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 13:02:44,258 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 13:02:44,259 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 13:02:44,259 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:02:15" (3/4) ... [2022-07-12 13:02:44,262 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 13:02:44,262 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 13:02:44,262 INFO L158 Benchmark]: Toolchain (without parser) took 30851.63ms. Allocated memory was 104.9MB in the beginning and 408.9MB in the end (delta: 304.1MB). Free memory was 60.7MB in the beginning and 301.2MB in the end (delta: -240.5MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2022-07-12 13:02:44,263 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory was 81.8MB in the beginning and 81.8MB in the end (delta: 38.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 13:02:44,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 849.81ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 60.4MB in the beginning and 69.3MB in the end (delta: -8.8MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2022-07-12 13:02:44,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.73ms. Allocated memory is still 130.0MB. Free memory was 69.3MB in the beginning and 63.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 13:02:44,264 INFO L158 Benchmark]: Boogie Preprocessor took 108.29ms. Allocated memory is still 130.0MB. Free memory was 63.0MB in the beginning and 57.5MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 13:02:44,264 INFO L158 Benchmark]: RCFGBuilder took 1203.48ms. Allocated memory is still 130.0MB. Free memory was 57.5MB in the beginning and 54.5MB in the end (delta: 3.0MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2022-07-12 13:02:44,265 INFO L158 Benchmark]: TraceAbstraction took 28568.37ms. Allocated memory was 130.0MB in the beginning and 408.9MB in the end (delta: 278.9MB). Free memory was 54.5MB in the beginning and 301.2MB in the end (delta: -246.6MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2022-07-12 13:02:44,265 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 408.9MB. Free memory is still 301.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 13:02:44,269 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.18ms. Allocated memory is still 104.9MB. Free memory was 81.8MB in the beginning and 81.8MB in the end (delta: 38.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 849.81ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 60.4MB in the beginning and 69.3MB in the end (delta: -8.8MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.73ms. Allocated memory is still 130.0MB. Free memory was 69.3MB in the beginning and 63.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.29ms. Allocated memory is still 130.0MB. Free memory was 63.0MB in the beginning and 57.5MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1203.48ms. Allocated memory is still 130.0MB. Free memory was 57.5MB in the beginning and 54.5MB in the end (delta: 3.0MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * TraceAbstraction took 28568.37ms. Allocated memory was 130.0MB in the beginning and 408.9MB in the end (delta: 278.9MB). Free memory was 54.5MB in the beginning and 301.2MB in the end (delta: -246.6MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 408.9MB. Free memory is still 301.2MB. 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#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1672]: 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 2227. Possible FailurePath: [L1695] int ldv_irq_1_2 = 0; [L1696] int LDV_IN_INTERRUPT = 1; [L1697] int ldv_irq_1_3 = 0; [L1698] struct platform_device *tegra_rtc_driver_group0 ; [L1699] void *ldv_irq_data_1_1 ; [L1700] int ldv_irq_1_1 = 0; [L1701] int ldv_irq_1_0 = 0; [L1702] int ldv_irq_line_1_3 ; [L1703] void *ldv_irq_data_1_0 ; [L1704] int ldv_state_variable_0 ; [L1705] struct device *tegra_rtc_ops_group1 ; [L1706] int ldv_state_variable_3 ; [L1707] int ldv_irq_line_1_0 ; [L1708] int ldv_state_variable_2 ; [L1709] void *ldv_irq_data_1_3 ; [L1710] int ref_cnt ; [L1711] int ldv_irq_line_1_1 ; [L1712] struct rtc_time *tegra_rtc_ops_group0 ; [L1713] void *ldv_irq_data_1_2 ; [L1714] int ldv_state_variable_1 ; [L1715] int ldv_irq_line_1_2 ; [L1716] struct rtc_wkalrm *tegra_rtc_ops_group2 ; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2243] int ldv_retval_2 ; [L2244] int ldv_retval_0 ; [L2246] int ldv_retval_1 ; [L2769] int ldv_init = 0; VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2398] struct seq_file *ldvarg1 ; [L2399] void *tmp ; [L2400] unsigned int ldvarg0 ; [L2401] unsigned int tmp___0 ; [L2402] pm_message_t ldvarg2 ; [L2403] int tmp___1 ; [L2404] int tmp___2 ; [L2405] int tmp___3 ; [L2406] int tmp___4 ; VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2408] CALL, EXPR ldv_zalloc(136U) VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1636] void *p ; [L1637] void *tmp ; [L1638] int tmp___0 ; [L1640] tmp___0 = __VERIFIER_nondet_int() [L1641] COND TRUE tmp___0 != 0 [L1642] return (0); VAL [\old(size)=136, \result={0:0}, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, size=136, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___0=-2] [L2408] RET, EXPR ldv_zalloc(136U) VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_zalloc(136U)={0:0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2408] tmp = ldv_zalloc(136U) [L2409] ldvarg1 = (struct seq_file *)tmp [L2410] tmp___0 = __VERIFIER_nondet_uint() [L2411] ldvarg0 = tmp___0 [L2412] FCALL ldv_initialize() [L2413] FCALL memset((void *)(& ldvarg2), 0, 4U) [L2414] ldv_state_variable_1 = 1 [L2415] ref_cnt = 0 [L2416] ldv_state_variable_0 = 1 [L2417] ldv_state_variable_3 = 0 [L2418] ldv_state_variable_2 = 0 VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629] [L2420] tmp___1 = __VERIFIER_nondet_int() [L2422] case 0: [L2428] case 1: VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=1] [L2429] COND TRUE ldv_state_variable_0 != 0 [L2430] tmp___2 = __VERIFIER_nondet_int() [L2432] case 0: [L2440] case 1: VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=1, tmp___2=1] [L2441] COND TRUE ldv_state_variable_0 == 1 [L2442] CALL, EXPR tegra_rtc_init() [L2230] int tmp ; [L2232] CALL, EXPR platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2848] return __VERIFIER_nondet_int(); [L2232] RET, EXPR platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2232] tmp = platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2233] return (tmp); VAL [\result=0, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp=0] [L2442] RET, EXPR tegra_rtc_init() [L2442] ldv_retval_0 = tegra_rtc_init() [L2443] COND TRUE ldv_retval_0 == 0 [L2444] ldv_state_variable_0 = 3 [L2445] ldv_state_variable_2 = 1 [L2446] CALL ldv_initialize_platform_driver_2() [L2363] void *tmp ; VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2365] CALL, EXPR ldv_zalloc(624U) VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1636] void *p ; [L1637] void *tmp ; [L1638] int tmp___0 ; [L1640] tmp___0 = __VERIFIER_nondet_int() [L1641] COND TRUE tmp___0 != 0 [L1642] return (0); VAL [\old(size)=624, \result={0:0}, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ref_cnt=0, size=624, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___0=-3] [L2365] RET, EXPR ldv_zalloc(624U) VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_zalloc(624U)={0:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2365] tmp = ldv_zalloc(624U) [L2366] tegra_rtc_driver_group0 = (struct platform_device *)tmp VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}] [L2446] RET ldv_initialize_platform_driver_2() [L2449] COND FALSE !(ldv_retval_0 != 0) VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=1, tmp___2=1] [L2420] tmp___1 = __VERIFIER_nondet_int() [L2422] case 0: [L2428] case 1: [L2464] case 2: [L2558] case 3: VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=3, tmp___2=1] [L2559] COND TRUE ldv_state_variable_2 != 0 [L2560] tmp___4 = __VERIFIER_nondet_int() [L2562] case 0: [L2574] case 1: [L2584] case 2: [L2604] case 3: [L2614] case 4: VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=3, tmp___2=1, tmp___4=4] [L2615] COND TRUE ldv_state_variable_2 == 1 [L2616] CALL ldv_probe_2() [L2836] return __VERIFIER_nondet_int(); [L2616] RET ldv_probe_2() [L2617] ldv_state_variable_2 = 2 [L2618] ref_cnt = ref_cnt + 1 VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=3, tmp___2=1, tmp___4=4] [L2420] tmp___1 = __VERIFIER_nondet_int() [L2422] case 0: [L2428] case 1: [L2464] case 2: [L2558] case 3: VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=3, tmp___2=1, tmp___4=4] [L2559] COND TRUE ldv_state_variable_2 != 0 [L2560] tmp___4 = __VERIFIER_nondet_int() [L2562] case 0: VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=3, tmp___2=1, tmp___4=0] [L2563] COND FALSE !(ldv_state_variable_2 == 4) VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=3, tmp___2=1, tmp___4=0] [L2568] COND TRUE ldv_state_variable_2 == 2 VAL [__this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=629, ldvarg1={0:0}, ldvarg2={17:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=629, tmp___1=3, tmp___2=1, tmp___4=0] [L2569] CALL tegra_rtc_shutdown(tegra_rtc_driver_group0) VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, pdev={0:0}, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2222] CALL tegra_rtc_alarm_irq_enable(& pdev->dev, 0U) VAL [\old(enabled)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1960] struct tegra_rtc_info *info ; [L1961] void *tmp ; [L1962] unsigned int status ; [L1963] unsigned long sl_irq_flags ; [L1964] u32 __v ; [L1965] u32 __v___0 ; VAL [\old(enabled)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, dev={0:12}, enabled=0, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1967] CALL, EXPR dev_get_drvdata((struct device const *)dev) VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, arg0={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2807] CALL, EXPR ldv_malloc(0UL) VAL [\old(size)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1618] void *p ; [L1619] void *tmp ; [L1620] int tmp___0 ; [L1622] tmp___0 = __VERIFIER_nondet_int() [L1623] COND TRUE tmp___0 != 0 [L1624] return (0); VAL [\old(size)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, \result={0:0}, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, size=0, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___0=1] [L2807] RET, EXPR ldv_malloc(0UL) VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, arg0={0:12}, arg0={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_malloc(0UL)={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2807] return ldv_malloc(0UL); [L1967] RET, EXPR dev_get_drvdata((struct device const *)dev) VAL [\old(enabled)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, dev={0:12}, dev_get_drvdata((struct device const *)dev)={0:0}, enabled=0, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1967] tmp = dev_get_drvdata((struct device const *)dev) [L1968] info = (struct tegra_rtc_info *)tmp VAL [\old(enabled)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, dev={0:12}, enabled=0, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}] [L1969] CALL tegra_rtc_wait_while_busy(dev) VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1843] struct tegra_rtc_info *info ; [L1844] void *tmp ; [L1845] int retries ; [L1846] int tmp___0 ; [L1847] u32 tmp___1 ; VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, dev={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1849] CALL, EXPR dev_get_drvdata((struct device const *)dev) VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, arg0={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2807] CALL, EXPR ldv_malloc(0UL) VAL [\old(size)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1618] void *p ; [L1619] void *tmp ; [L1620] int tmp___0 ; [L1622] tmp___0 = __VERIFIER_nondet_int() [L1623] COND TRUE tmp___0 != 0 [L1624] return (0); VAL [\old(size)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, \result={0:0}, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, size=0, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___0=1] [L2807] RET, EXPR ldv_malloc(0UL) VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, arg0={0:12}, arg0={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_malloc(0UL)={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2807] return ldv_malloc(0UL); [L1849] RET, EXPR dev_get_drvdata((struct device const *)dev) VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, dev={0:12}, dev_get_drvdata((struct device const *)dev)={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1849] tmp = dev_get_drvdata((struct device const *)dev) [L1850] info = (struct tegra_rtc_info *)tmp [L1851] retries = 500 VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, dev={0:12}, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, retries=500, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}] [L1862] CALL, EXPR tegra_rtc_check_busy(info) [L1833] u32 __v ; [L1834] u32 __v___0 ; [L1836] EXPR info->rtc_base [L1836] EXPR (unsigned int volatile *)info->rtc_base + 4U [L1836] __v___0 = *((unsigned int volatile *)info->rtc_base + 4U) [L1837] __v = __v___0 [L1838] return (__v & 1U); VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, \result=0, __this_module={627:630}, __v=0, __v___0=0, info={0:0}, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1862] RET, EXPR tegra_rtc_check_busy(info) [L1862] tmp___1 = tegra_rtc_check_busy(info) [L1863] COND FALSE !(tmp___1 != 0U) [L1867] return (0); VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, \result=0, __this_module={627:630}, dev={0:12}, dev={0:12}, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, retries=500, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___1=0] [L1969] RET tegra_rtc_wait_while_busy(dev) VAL [\old(enabled)=0, \old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, dev={0:12}, dev={0:12}, enabled=0, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tegra_rtc_wait_while_busy(dev)=0, tmp={0:0}] [L1970] CALL ldv_spin_lock_check() VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2783] COND FALSE !(ldv_init == 1) VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2785] CALL ldv_error() VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1672] reach_error() VAL [\old(status = status & 4294967294U)=626, \old(status = status | 1U)=625, __this_module={627:630}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, status = status & 4294967294U=626, status = status | 1U=625, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 32 procedures, 400 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.3s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12683 SdHoareTripleChecker+Valid, 13.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12309 mSDsluCounter, 30677 SdHoareTripleChecker+Invalid, 11.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23549 mSDsCounter, 4236 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20407 IncrementalHoareTripleChecker+Invalid, 24643 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4236 mSolverCounterUnsat, 7128 mSDtfsCounter, 20407 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1441 GetRequests, 1120 SyntacticMatches, 4 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2236 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1918occurred in iteration=12, InterpolantAutomatonStates: 234, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 5565 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1893 NumberOfCodeBlocks, 1893 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2110 ConstructedInterpolants, 0 QuantifiedInterpolants, 4248 SizeOfPredicates, 29 NumberOfNonLiveVariables, 5307 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 29 InterpolantComputations, 13 PerfectInterpolantSequences, 552/622 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-12 13:02:44,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.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 440f273968b34677cc4ba81db9f48373d3cac4b8a75ac1f970ae3fdbbff89c17 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 13:02:46,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 13:02:46,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 13:02:46,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 13:02:46,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 13:02:46,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 13:02:46,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 13:02:46,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 13:02:46,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 13:02:46,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 13:02:46,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 13:02:46,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 13:02:46,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 13:02:46,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 13:02:46,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 13:02:46,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 13:02:46,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 13:02:46,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 13:02:46,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 13:02:46,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 13:02:46,216 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 13:02:46,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 13:02:46,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 13:02:46,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 13:02:46,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 13:02:46,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 13:02:46,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 13:02:46,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 13:02:46,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 13:02:46,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 13:02:46,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 13:02:46,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 13:02:46,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 13:02:46,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 13:02:46,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 13:02:46,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 13:02:46,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 13:02:46,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 13:02:46,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 13:02:46,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 13:02:46,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 13:02:46,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 13:02:46,242 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-12 13:02:46,273 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 13:02:46,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 13:02:46,274 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 13:02:46,274 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 13:02:46,274 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 13:02:46,275 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 13:02:46,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 13:02:46,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 13:02:46,276 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 13:02:46,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 13:02:46,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 13:02:46,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 13:02:46,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 13:02:46,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 13:02:46,277 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 13:02:46,277 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 13:02:46,277 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 13:02:46,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 13:02:46,278 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 13:02:46,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 13:02:46,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 13:02:46,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 13:02:46,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 13:02:46,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:02:46,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 13:02:46,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 13:02:46,279 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 13:02:46,279 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 13:02:46,279 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 13:02:46,280 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 13:02:46,280 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 13:02:46,280 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 13:02:46,280 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 13:02:46,280 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 -> 440f273968b34677cc4ba81db9f48373d3cac4b8a75ac1f970ae3fdbbff89c17 [2022-07-12 13:02:46,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 13:02:46,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 13:02:46,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 13:02:46,637 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 13:02:46,637 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 13:02:46,640 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2022-07-12 13:02:46,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c5837bea/ae477bbfe396485f908dfbebd257acf6/FLAGd41e69fc8 [2022-07-12 13:02:47,285 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 13:02:47,286 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2022-07-12 13:02:47,314 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c5837bea/ae477bbfe396485f908dfbebd257acf6/FLAGd41e69fc8 [2022-07-12 13:02:47,718 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c5837bea/ae477bbfe396485f908dfbebd257acf6 [2022-07-12 13:02:47,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 13:02:47,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 13:02:47,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 13:02:47,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 13:02:47,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 13:02:47,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:02:47" (1/1) ... [2022-07-12 13:02:47,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e6aae89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:47, skipping insertion in model container [2022-07-12 13:02:47,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:02:47" (1/1) ... [2022-07-12 13:02:47,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 13:02:47,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 13:02:48,178 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i[49178,49191] [2022-07-12 13:02:48,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:02:48,470 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-12 13:02:48,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 13:02:48,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i[49178,49191] [2022-07-12 13:02:48,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:02:48,636 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 13:02:48,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i[49178,49191] [2022-07-12 13:02:48,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:02:48,821 INFO L208 MainTranslator]: Completed translation [2022-07-12 13:02:48,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:48 WrapperNode [2022-07-12 13:02:48,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 13:02:48,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 13:02:48,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 13:02:48,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 13:02:48,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:48" (1/1) ... [2022-07-12 13:02:48,878 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:48" (1/1) ... [2022-07-12 13:02:48,935 INFO L137 Inliner]: procedures = 121, calls = 360, calls flagged for inlining = 51, calls inlined = 35, statements flattened = 791 [2022-07-12 13:02:48,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 13:02:48,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 13:02:48,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 13:02:48,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 13:02:48,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:48" (1/1) ... [2022-07-12 13:02:48,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:48" (1/1) ... [2022-07-12 13:02:48,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:48" (1/1) ... [2022-07-12 13:02:48,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:48" (1/1) ... [2022-07-12 13:02:49,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:48" (1/1) ... [2022-07-12 13:02:49,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:48" (1/1) ... [2022-07-12 13:02:49,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:48" (1/1) ... [2022-07-12 13:02:49,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 13:02:49,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 13:02:49,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 13:02:49,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 13:02:49,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:48" (1/1) ... [2022-07-12 13:02:49,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:02:49,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:02:49,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 13:02:49,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 13:02:49,113 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-12 13:02:49,114 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-12 13:02:49,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-12 13:02:49,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-12 13:02:49,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 13:02:49,114 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 13:02:49,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 13:02:49,114 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_time_to_tm [2022-07-12 13:02:49,114 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_time_to_tm [2022-07-12 13:02:49,114 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_proc [2022-07-12 13:02:49,114 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_proc [2022-07-12 13:02:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2022-07-12 13:02:49,115 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2022-07-12 13:02:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure outer_sync [2022-07-12 13:02:49,115 INFO L138 BoogieDeclarations]: Found implementation of procedure outer_sync [2022-07-12 13:02:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_remove [2022-07-12 13:02:49,115 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_remove [2022-07-12 13:02:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_shutdown [2022-07-12 13:02:49,115 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_shutdown [2022-07-12 13:02:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 13:02:49,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 13:02:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_tm_to_time [2022-07-12 13:02:49,115 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_tm_to_time [2022-07-12 13:02:49,116 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-12 13:02:49,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-12 13:02:49,116 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 13:02:49,116 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 13:02:49,116 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_alarm [2022-07-12 13:02:49,116 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_alarm [2022-07-12 13:02:49,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 13:02:49,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 13:02:49,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_check [2022-07-12 13:02:49,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_check [2022-07-12 13:02:49,116 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_alarm_irq_enable [2022-07-12 13:02:49,116 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_alarm_irq_enable [2022-07-12 13:02:49,116 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_iounmap [2022-07-12 13:02:49,117 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_iounmap [2022-07-12 13:02:49,117 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 13:02:49,117 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 13:02:49,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 13:02:49,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 13:02:49,117 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_device_unregister [2022-07-12 13:02:49,117 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_device_unregister [2022-07-12 13:02:49,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 13:02:49,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-07-12 13:02:49,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-07-12 13:02:49,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 13:02:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 13:02:49,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 13:02:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2022-07-12 13:02:49,118 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2022-07-12 13:02:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-12 13:02:49,118 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-12 13:02:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-12 13:02:49,118 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-12 13:02:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-12 13:02:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-12 13:02:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 13:02:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 13:02:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2022-07-12 13:02:49,119 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2022-07-12 13:02:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 13:02:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-07-12 13:02:49,119 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-07-12 13:02:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 13:02:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_read_time [2022-07-12 13:02:49,119 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_read_time [2022-07-12 13:02:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_wait_while_busy [2022-07-12 13:02:49,119 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_wait_while_busy [2022-07-12 13:02:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-12 13:02:49,120 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-12 13:02:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 13:02:49,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 13:02:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_time [2022-07-12 13:02:49,120 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_time [2022-07-12 13:02:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 13:02:49,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 13:02:49,426 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 13:02:49,428 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 13:02:49,714 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 13:02:52,554 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 13:02:52,563 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 13:02:52,564 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 13:02:52,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:02:52 BoogieIcfgContainer [2022-07-12 13:02:52,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 13:02:52,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 13:02:52,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 13:02:52,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 13:02:52,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 01:02:47" (1/3) ... [2022-07-12 13:02:52,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ac5a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:02:52, skipping insertion in model container [2022-07-12 13:02:52,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:02:48" (2/3) ... [2022-07-12 13:02:52,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ac5a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:02:52, skipping insertion in model container [2022-07-12 13:02:52,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:02:52" (3/3) ... [2022-07-12 13:02:52,572 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2022-07-12 13:02:52,583 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 13:02:52,583 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 13:02:52,631 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 13:02:52,636 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5bcebc4f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@938f5aa [2022-07-12 13:02:52,636 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 13:02:52,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 381 states, 270 states have (on average 1.3407407407407408) internal successors, (362), 280 states have internal predecessors, (362), 79 states have call successors, (79), 31 states have call predecessors, (79), 30 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2022-07-12 13:02:52,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 13:02:52,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:52,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:02:52,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:52,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:52,658 INFO L85 PathProgramCache]: Analyzing trace with hash -422849068, now seen corresponding path program 1 times [2022-07-12 13:02:52,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 13:02:52,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419650375] [2022-07-12 13:02:52,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:52,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 13:02:52,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 13:02:52,671 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) [2022-07-12 13:02:52,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 13:02:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:52,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 13:02:52,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:02:53,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 13:02:53,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:02:53,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 13:02:53,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419650375] [2022-07-12 13:02:53,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419650375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:53,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:02:53,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 13:02:53,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629794901] [2022-07-12 13:02:53,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:53,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 13:02:53,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 13:02:53,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 13:02:53,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 13:02:53,098 INFO L87 Difference]: Start difference. First operand has 381 states, 270 states have (on average 1.3407407407407408) internal successors, (362), 280 states have internal predecessors, (362), 79 states have call successors, (79), 31 states have call predecessors, (79), 30 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 13:02:53,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:53,222 INFO L93 Difference]: Finished difference Result 758 states and 1077 transitions. [2022-07-12 13:02:53,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 13:02:53,225 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-07-12 13:02:53,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:53,236 INFO L225 Difference]: With dead ends: 758 [2022-07-12 13:02:53,236 INFO L226 Difference]: Without dead ends: 366 [2022-07-12 13:02:53,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 13:02:53,244 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:53,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1016 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 13:02:53,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-07-12 13:02:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2022-07-12 13:02:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 263 states have (on average 1.311787072243346) internal successors, (345), 265 states have internal predecessors, (345), 73 states have call successors, (73), 30 states have call predecessors, (73), 29 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-07-12 13:02:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 490 transitions. [2022-07-12 13:02:53,301 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 490 transitions. Word has length 39 [2022-07-12 13:02:53,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:53,303 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 490 transitions. [2022-07-12 13:02:53,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 13:02:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 490 transitions. [2022-07-12 13:02:53,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 13:02:53,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:53,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:02:53,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 13:02:53,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 13:02:53,519 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:53,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:53,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1341730321, now seen corresponding path program 1 times [2022-07-12 13:02:53,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 13:02:53,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024171317] [2022-07-12 13:02:53,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:53,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 13:02:53,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 13:02:53,523 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) [2022-07-12 13:02:53,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 13:02:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:53,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 13:02:53,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:02:53,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 13:02:53,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:02:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 13:02:53,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 13:02:53,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024171317] [2022-07-12 13:02:53,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024171317] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 13:02:53,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 13:02:53,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 13:02:53,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74523175] [2022-07-12 13:02:53,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 13:02:53,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:02:53,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 13:02:53,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:02:53,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:02:53,952 INFO L87 Difference]: Start difference. First operand 366 states and 490 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 13:02:54,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:54,107 INFO L93 Difference]: Finished difference Result 728 states and 977 transitions. [2022-07-12 13:02:54,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:02:54,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-07-12 13:02:54,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:54,115 INFO L225 Difference]: With dead ends: 728 [2022-07-12 13:02:54,115 INFO L226 Difference]: Without dead ends: 369 [2022-07-12 13:02:54,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:02:54,122 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 0 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:54,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1460 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 13:02:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-07-12 13:02:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2022-07-12 13:02:54,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 266 states have (on average 1.3082706766917294) internal successors, (348), 268 states have internal predecessors, (348), 73 states have call successors, (73), 30 states have call predecessors, (73), 29 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-07-12 13:02:54,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 493 transitions. [2022-07-12 13:02:54,151 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 493 transitions. Word has length 39 [2022-07-12 13:02:54,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:54,151 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 493 transitions. [2022-07-12 13:02:54,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 13:02:54,151 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 493 transitions. [2022-07-12 13:02:54,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 13:02:54,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:54,153 INFO L195 NwaCegarLoop]: 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, 1] [2022-07-12 13:02:54,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 13:02:54,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 13:02:54,366 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:54,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:54,367 INFO L85 PathProgramCache]: Analyzing trace with hash -376881154, now seen corresponding path program 2 times [2022-07-12 13:02:54,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 13:02:54,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471642393] [2022-07-12 13:02:54,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 13:02:54,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 13:02:54,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 13:02:54,369 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) [2022-07-12 13:02:54,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 13:02:54,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 13:02:54,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 13:02:54,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 13:02:54,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:02:54,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 13:02:54,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:02:54,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 13:02:54,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471642393] [2022-07-12 13:02:54,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471642393] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:54,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:02:54,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 13:02:54,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606779748] [2022-07-12 13:02:54,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:54,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 13:02:54,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 13:02:54,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 13:02:54,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 13:02:54,627 INFO L87 Difference]: Start difference. First operand 369 states and 493 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 13:02:54,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:54,676 INFO L93 Difference]: Finished difference Result 621 states and 819 transitions. [2022-07-12 13:02:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 13:02:54,677 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-07-12 13:02:54,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:54,680 INFO L225 Difference]: With dead ends: 621 [2022-07-12 13:02:54,682 INFO L226 Difference]: Without dead ends: 263 [2022-07-12 13:02:54,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 13:02:54,689 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 327 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:54,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 333 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 13:02:54,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-12 13:02:54,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2022-07-12 13:02:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 191 states have (on average 1.2722513089005236) internal successors, (243), 192 states have internal predecessors, (243), 48 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2022-07-12 13:02:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 338 transitions. [2022-07-12 13:02:54,704 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 338 transitions. Word has length 42 [2022-07-12 13:02:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:54,704 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 338 transitions. [2022-07-12 13:02:54,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 13:02:54,705 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 338 transitions. [2022-07-12 13:02:54,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-12 13:02:54,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:54,707 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-07-12 13:02:54,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 13:02:54,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 13:02:54,919 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:54,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:54,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2129106285, now seen corresponding path program 1 times [2022-07-12 13:02:54,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 13:02:54,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765154270] [2022-07-12 13:02:54,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:54,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 13:02:54,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 13:02:54,922 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) [2022-07-12 13:02:54,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 13:02:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:55,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 13:02:55,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:02:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 13:02:55,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:02:55,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 13:02:55,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765154270] [2022-07-12 13:02:55,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765154270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:55,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:02:55,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 13:02:55,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486747398] [2022-07-12 13:02:55,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:55,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 13:02:55,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 13:02:55,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 13:02:55,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 13:02:55,248 INFO L87 Difference]: Start difference. First operand 263 states and 338 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 13:02:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:55,372 INFO L93 Difference]: Finished difference Result 626 states and 807 transitions. [2022-07-12 13:02:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 13:02:55,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2022-07-12 13:02:55,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:55,375 INFO L225 Difference]: With dead ends: 626 [2022-07-12 13:02:55,375 INFO L226 Difference]: Without dead ends: 374 [2022-07-12 13:02:55,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 13:02:55,380 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 144 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:55,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 648 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 13:02:55,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-12 13:02:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2022-07-12 13:02:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 273 states have (on average 1.2820512820512822) internal successors, (350), 275 states have internal predecessors, (350), 65 states have call successors, (65), 33 states have call predecessors, (65), 32 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-07-12 13:02:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 479 transitions. [2022-07-12 13:02:55,401 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 479 transitions. Word has length 61 [2022-07-12 13:02:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:55,401 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 479 transitions. [2022-07-12 13:02:55,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 13:02:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 479 transitions. [2022-07-12 13:02:55,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 13:02:55,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:55,403 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-07-12 13:02:55,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 13:02:55,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 13:02:55,618 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:55,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:55,618 INFO L85 PathProgramCache]: Analyzing trace with hash 685608890, now seen corresponding path program 1 times [2022-07-12 13:02:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 13:02:55,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204610787] [2022-07-12 13:02:55,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:55,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 13:02:55,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 13:02:55,621 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) [2022-07-12 13:02:55,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 13:02:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:55,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 13:02:55,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:02:55,995 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 13:02:55,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:02:55,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 13:02:55,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204610787] [2022-07-12 13:02:55,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204610787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:55,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:02:55,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 13:02:55,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675848249] [2022-07-12 13:02:55,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:55,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:02:55,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 13:02:55,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:02:55,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:02:55,997 INFO L87 Difference]: Start difference. First operand 371 states and 479 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 13:02:56,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:56,162 INFO L93 Difference]: Finished difference Result 1095 states and 1427 transitions. [2022-07-12 13:02:56,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 13:02:56,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2022-07-12 13:02:56,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:56,168 INFO L225 Difference]: With dead ends: 1095 [2022-07-12 13:02:56,168 INFO L226 Difference]: Without dead ends: 744 [2022-07-12 13:02:56,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:02:56,170 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 332 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:56,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1484 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 13:02:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-07-12 13:02:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 721. [2022-07-12 13:02:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 530 states have (on average 1.2849056603773585) internal successors, (681), 542 states have internal predecessors, (681), 125 states have call successors, (125), 66 states have call predecessors, (125), 65 states have return successors, (127), 116 states have call predecessors, (127), 124 states have call successors, (127) [2022-07-12 13:02:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 933 transitions. [2022-07-12 13:02:56,204 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 933 transitions. Word has length 59 [2022-07-12 13:02:56,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:56,204 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 933 transitions. [2022-07-12 13:02:56,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 13:02:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 933 transitions. [2022-07-12 13:02:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-12 13:02:56,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:56,206 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-07-12 13:02:56,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 13:02:56,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 13:02:56,420 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:56,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:56,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2003167721, now seen corresponding path program 1 times [2022-07-12 13:02:56,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 13:02:56,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66907637] [2022-07-12 13:02:56,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:56,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 13:02:56,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 13:02:56,423 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) [2022-07-12 13:02:56,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 13:02:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:56,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 13:02:56,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:02:56,774 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 13:02:56,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:02:56,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 13:02:56,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66907637] [2022-07-12 13:02:56,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66907637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:56,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:02:56,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 13:02:56,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992245722] [2022-07-12 13:02:56,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:56,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:02:56,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 13:02:56,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:02:56,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:02:56,776 INFO L87 Difference]: Start difference. First operand 721 states and 933 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 13:02:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:56,891 INFO L93 Difference]: Finished difference Result 1454 states and 1889 transitions. [2022-07-12 13:02:56,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:02:56,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2022-07-12 13:02:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:56,896 INFO L225 Difference]: With dead ends: 1454 [2022-07-12 13:02:56,896 INFO L226 Difference]: Without dead ends: 753 [2022-07-12 13:02:56,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:02:56,899 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 323 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:56,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 980 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 13:02:56,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2022-07-12 13:02:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 729. [2022-07-12 13:02:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 538 states have (on average 1.2769516728624535) internal successors, (687), 548 states have internal predecessors, (687), 123 states have call successors, (123), 68 states have call predecessors, (123), 67 states have return successors, (125), 116 states have call predecessors, (125), 122 states have call successors, (125) [2022-07-12 13:02:56,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 935 transitions. [2022-07-12 13:02:56,939 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 935 transitions. Word has length 60 [2022-07-12 13:02:56,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:56,939 INFO L495 AbstractCegarLoop]: Abstraction has 729 states and 935 transitions. [2022-07-12 13:02:56,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 13:02:56,940 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 935 transitions. [2022-07-12 13:02:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 13:02:56,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:56,942 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-07-12 13:02:56,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 13:02:57,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 13:02:57,155 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:57,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:57,155 INFO L85 PathProgramCache]: Analyzing trace with hash -524865236, now seen corresponding path program 1 times [2022-07-12 13:02:57,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 13:02:57,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034287623] [2022-07-12 13:02:57,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:57,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 13:02:57,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 13:02:57,157 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) [2022-07-12 13:02:57,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 13:02:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:57,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 13:02:57,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:02:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 13:02:57,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:02:57,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 13:02:57,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034287623] [2022-07-12 13:02:57,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034287623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:57,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:02:57,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 13:02:57,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715524697] [2022-07-12 13:02:57,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:57,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:02:57,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 13:02:57,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:02:57,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:02:57,482 INFO L87 Difference]: Start difference. First operand 729 states and 935 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 13:02:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:57,598 INFO L93 Difference]: Finished difference Result 1470 states and 1889 transitions. [2022-07-12 13:02:57,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:02:57,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2022-07-12 13:02:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:57,603 INFO L225 Difference]: With dead ends: 1470 [2022-07-12 13:02:57,603 INFO L226 Difference]: Without dead ends: 761 [2022-07-12 13:02:57,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:02:57,606 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 319 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:57,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 977 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 13:02:57,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-07-12 13:02:57,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 737. [2022-07-12 13:02:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 546 states have (on average 1.2692307692307692) internal successors, (693), 554 states have internal predecessors, (693), 121 states have call successors, (121), 70 states have call predecessors, (121), 69 states have return successors, (123), 116 states have call predecessors, (123), 120 states have call successors, (123) [2022-07-12 13:02:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 937 transitions. [2022-07-12 13:02:57,633 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 937 transitions. Word has length 62 [2022-07-12 13:02:57,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:57,634 INFO L495 AbstractCegarLoop]: Abstraction has 737 states and 937 transitions. [2022-07-12 13:02:57,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 13:02:57,634 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 937 transitions. [2022-07-12 13:02:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-12 13:02:57,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:57,635 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-07-12 13:02:57,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-12 13:02:57,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 13:02:57,843 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:57,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:57,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1732611677, now seen corresponding path program 1 times [2022-07-12 13:02:57,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 13:02:57,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079565118] [2022-07-12 13:02:57,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:57,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 13:02:57,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 13:02:57,846 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) [2022-07-12 13:02:57,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 13:02:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:58,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 13:02:58,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:02:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 13:02:58,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:02:58,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 13:02:58,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079565118] [2022-07-12 13:02:58,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079565118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:02:58,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:02:58,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 13:02:58,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182099504] [2022-07-12 13:02:58,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:58,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 13:02:58,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 13:02:58,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 13:02:58,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:02:58,167 INFO L87 Difference]: Start difference. First operand 737 states and 937 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 13:02:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:58,277 INFO L93 Difference]: Finished difference Result 1403 states and 1785 transitions. [2022-07-12 13:02:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:02:58,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2022-07-12 13:02:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:58,281 INFO L225 Difference]: With dead ends: 1403 [2022-07-12 13:02:58,281 INFO L226 Difference]: Without dead ends: 686 [2022-07-12 13:02:58,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:02:58,284 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 318 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:58,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 974 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 13:02:58,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-07-12 13:02:58,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 668. [2022-07-12 13:02:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 498 states have (on average 1.2590361445783131) internal successors, (627), 502 states have internal predecessors, (627), 105 states have call successors, (105), 65 states have call predecessors, (105), 64 states have return successors, (107), 102 states have call predecessors, (107), 104 states have call successors, (107) [2022-07-12 13:02:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 839 transitions. [2022-07-12 13:02:58,308 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 839 transitions. Word has length 61 [2022-07-12 13:02:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:58,308 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 839 transitions. [2022-07-12 13:02:58,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 13:02:58,309 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 839 transitions. [2022-07-12 13:02:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 13:02:58,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:58,310 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:02:58,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 13:02:58,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 13:02:58,526 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:02:58,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:02:58,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1941224850, now seen corresponding path program 1 times [2022-07-12 13:02:58,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 13:02:58,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484905888] [2022-07-12 13:02:58,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:02:58,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 13:02:58,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 13:02:58,529 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) [2022-07-12 13:02:58,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 13:02:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:02:58,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 13:02:58,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:02:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 13:02:58,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:02:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 13:02:59,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 13:02:59,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484905888] [2022-07-12 13:02:59,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484905888] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 13:02:59,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:02:59,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 10 [2022-07-12 13:02:59,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362220505] [2022-07-12 13:02:59,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:02:59,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 13:02:59,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 13:02:59,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 13:02:59,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 13:02:59,097 INFO L87 Difference]: Start difference. First operand 668 states and 839 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 13:02:59,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:02:59,915 INFO L93 Difference]: Finished difference Result 1622 states and 2039 transitions. [2022-07-12 13:02:59,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 13:02:59,916 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2022-07-12 13:02:59,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:02:59,924 INFO L225 Difference]: With dead ends: 1622 [2022-07-12 13:02:59,924 INFO L226 Difference]: Without dead ends: 981 [2022-07-12 13:02:59,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-07-12 13:02:59,928 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 341 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 13:02:59,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1996 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 13:02:59,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-07-12 13:02:59,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 918. [2022-07-12 13:02:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 688 states have (on average 1.2674418604651163) internal successors, (872), 690 states have internal predecessors, (872), 143 states have call successors, (143), 87 states have call predecessors, (143), 86 states have return successors, (145), 142 states have call predecessors, (145), 142 states have call successors, (145) [2022-07-12 13:02:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1160 transitions. [2022-07-12 13:02:59,962 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1160 transitions. Word has length 71 [2022-07-12 13:02:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:02:59,963 INFO L495 AbstractCegarLoop]: Abstraction has 918 states and 1160 transitions. [2022-07-12 13:02:59,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 13:02:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1160 transitions. [2022-07-12 13:02:59,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 13:02:59,965 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:02:59,965 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 13:02:59,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 13:03:00,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 13:03:00,182 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:03:00,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:03:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash 644086264, now seen corresponding path program 1 times [2022-07-12 13:03:00,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 13:03:00,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945812512] [2022-07-12 13:03:00,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:03:00,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 13:03:00,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 13:03:00,185 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) [2022-07-12 13:03:00,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 13:03:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:03:00,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 13:03:00,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:03:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 13:03:00,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:03:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 13:03:00,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 13:03:00,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945812512] [2022-07-12 13:03:00,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945812512] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 13:03:00,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 13:03:00,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-07-12 13:03:00,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452103348] [2022-07-12 13:03:00,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 13:03:00,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 13:03:00,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 13:03:00,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 13:03:00,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:03:00,751 INFO L87 Difference]: Start difference. First operand 918 states and 1160 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 13:03:02,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:03:02,388 INFO L93 Difference]: Finished difference Result 2134 states and 2693 transitions. [2022-07-12 13:03:02,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 13:03:02,389 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 72 [2022-07-12 13:03:02,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:03:02,396 INFO L225 Difference]: With dead ends: 2134 [2022-07-12 13:03:02,396 INFO L226 Difference]: Without dead ends: 1243 [2022-07-12 13:03:02,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2022-07-12 13:03:02,399 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 722 mSDsluCounter, 2359 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 13:03:02,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 2738 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 13:03:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2022-07-12 13:03:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1178. [2022-07-12 13:03:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 884 states have (on average 1.2703619909502262) internal successors, (1123), 888 states have internal predecessors, (1123), 183 states have call successors, (183), 111 states have call predecessors, (183), 110 states have return successors, (185), 180 states have call predecessors, (185), 182 states have call successors, (185) [2022-07-12 13:03:02,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1491 transitions. [2022-07-12 13:03:02,458 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1491 transitions. Word has length 72 [2022-07-12 13:03:02,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:03:02,458 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1491 transitions. [2022-07-12 13:03:02,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 13:03:02,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1491 transitions. [2022-07-12 13:03:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-12 13:03:02,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:03:02,462 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 13:03:02,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 13:03:02,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 13:03:02,677 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:03:02,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:03:02,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1082506311, now seen corresponding path program 1 times [2022-07-12 13:03:02,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 13:03:02,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477761321] [2022-07-12 13:03:02,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:03:02,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 13:03:02,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 13:03:02,679 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) [2022-07-12 13:03:02,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 13:03:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:03:02,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 13:03:02,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:03:03,020 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 13:03:03,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:03:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 13:03:03,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 13:03:03,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477761321] [2022-07-12 13:03:03,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477761321] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 13:03:03,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 13:03:03,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-07-12 13:03:03,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81949669] [2022-07-12 13:03:03,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 13:03:03,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 13:03:03,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 13:03:03,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 13:03:03,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:03:03,204 INFO L87 Difference]: Start difference. First operand 1178 states and 1491 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 9 states have internal predecessors, (66), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 13:03:04,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:03:04,686 INFO L93 Difference]: Finished difference Result 2654 states and 3355 transitions. [2022-07-12 13:03:04,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 13:03:04,687 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 9 states have internal predecessors, (66), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 73 [2022-07-12 13:03:04,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:03:04,694 INFO L225 Difference]: With dead ends: 2654 [2022-07-12 13:03:04,694 INFO L226 Difference]: Without dead ends: 1503 [2022-07-12 13:03:04,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2022-07-12 13:03:04,704 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 764 mSDsluCounter, 2131 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 2510 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:03:04,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 2510 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 13:03:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2022-07-12 13:03:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1178. [2022-07-12 13:03:04,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 884 states have (on average 1.2703619909502262) internal successors, (1123), 888 states have internal predecessors, (1123), 183 states have call successors, (183), 111 states have call predecessors, (183), 110 states have return successors, (185), 180 states have call predecessors, (185), 182 states have call successors, (185) [2022-07-12 13:03:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1491 transitions. [2022-07-12 13:03:04,749 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1491 transitions. Word has length 73 [2022-07-12 13:03:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:03:04,750 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1491 transitions. [2022-07-12 13:03:04,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 9 states have internal predecessors, (66), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 13:03:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1491 transitions. [2022-07-12 13:03:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-12 13:03:04,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:03:04,752 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 13:03:04,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 13:03:04,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 13:03:04,965 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:03:04,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:03:04,966 INFO L85 PathProgramCache]: Analyzing trace with hash -608187279, now seen corresponding path program 1 times [2022-07-12 13:03:04,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 13:03:04,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284871799] [2022-07-12 13:03:04,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:03:04,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 13:03:04,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 13:03:04,969 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) [2022-07-12 13:03:04,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 13:03:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:03:05,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 13:03:05,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:03:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 13:03:05,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:03:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 13:03:05,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 13:03:05,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284871799] [2022-07-12 13:03:05,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284871799] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 13:03:05,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 13:03:05,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-07-12 13:03:05,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153881931] [2022-07-12 13:03:05,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 13:03:05,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 13:03:05,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 13:03:05,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 13:03:05,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:03:05,548 INFO L87 Difference]: Start difference. First operand 1178 states and 1491 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 13:03:06,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:03:06,748 INFO L93 Difference]: Finished difference Result 2654 states and 3355 transitions. [2022-07-12 13:03:06,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 13:03:06,749 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 74 [2022-07-12 13:03:06,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:03:06,756 INFO L225 Difference]: With dead ends: 2654 [2022-07-12 13:03:06,756 INFO L226 Difference]: Without dead ends: 1503 [2022-07-12 13:03:06,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2022-07-12 13:03:06,761 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 774 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 13:03:06,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1869 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 13:03:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2022-07-12 13:03:06,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1178. [2022-07-12 13:03:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 884 states have (on average 1.2703619909502262) internal successors, (1123), 888 states have internal predecessors, (1123), 183 states have call successors, (183), 111 states have call predecessors, (183), 110 states have return successors, (185), 180 states have call predecessors, (185), 182 states have call successors, (185) [2022-07-12 13:03:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1491 transitions. [2022-07-12 13:03:06,802 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1491 transitions. Word has length 74 [2022-07-12 13:03:06,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:03:06,803 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1491 transitions. [2022-07-12 13:03:06,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 13:03:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1491 transitions. [2022-07-12 13:03:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-12 13:03:06,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:03:06,806 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:03:06,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 13:03:07,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 13:03:07,022 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:03:07,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:03:07,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2022215437, now seen corresponding path program 1 times [2022-07-12 13:03:07,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 13:03:07,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810145642] [2022-07-12 13:03:07,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:03:07,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 13:03:07,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 13:03:07,025 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) [2022-07-12 13:03:07,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 13:03:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:03:07,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 13:03:07,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:03:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 13:03:07,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:03:07,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 13:03:07,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810145642] [2022-07-12 13:03:07,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810145642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:03:07,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:03:07,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 13:03:07,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681778214] [2022-07-12 13:03:07,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:03:07,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 13:03:07,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 13:03:07,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 13:03:07,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 13:03:07,278 INFO L87 Difference]: Start difference. First operand 1178 states and 1491 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 13:03:07,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:03:07,455 INFO L93 Difference]: Finished difference Result 2624 states and 3365 transitions. [2022-07-12 13:03:07,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 13:03:07,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 79 [2022-07-12 13:03:07,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:03:07,463 INFO L225 Difference]: With dead ends: 2624 [2022-07-12 13:03:07,463 INFO L226 Difference]: Without dead ends: 1473 [2022-07-12 13:03:07,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 13:03:07,467 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 151 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:03:07,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 762 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 13:03:07,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2022-07-12 13:03:07,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1470. [2022-07-12 13:03:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1141 states have (on average 1.284837861524978) internal successors, (1466), 1147 states have internal predecessors, (1466), 199 states have call successors, (199), 130 states have call predecessors, (199), 129 states have return successors, (201), 195 states have call predecessors, (201), 198 states have call successors, (201) [2022-07-12 13:03:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 1866 transitions. [2022-07-12 13:03:07,515 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 1866 transitions. Word has length 79 [2022-07-12 13:03:07,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:03:07,516 INFO L495 AbstractCegarLoop]: Abstraction has 1470 states and 1866 transitions. [2022-07-12 13:03:07,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 13:03:07,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1866 transitions. [2022-07-12 13:03:07,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 13:03:07,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:03:07,518 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:03:07,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 13:03:07,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 13:03:07,734 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:03:07,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:03:07,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1967013804, now seen corresponding path program 1 times [2022-07-12 13:03:07,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 13:03:07,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337469520] [2022-07-12 13:03:07,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:03:07,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 13:03:07,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 13:03:07,736 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) [2022-07-12 13:03:07,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 13:03:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:03:07,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 13:03:07,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:03:08,215 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 13:03:08,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:03:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 13:03:08,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 13:03:08,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337469520] [2022-07-12 13:03:08,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337469520] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 13:03:08,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 13:03:08,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2022-07-12 13:03:08,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970577175] [2022-07-12 13:03:08,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 13:03:08,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 13:03:08,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 13:03:08,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 13:03:08,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-12 13:03:08,626 INFO L87 Difference]: Start difference. First operand 1470 states and 1866 transitions. Second operand has 16 states, 16 states have (on average 4.625) internal successors, (74), 13 states have internal predecessors, (74), 4 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-12 13:03:10,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:03:10,001 INFO L93 Difference]: Finished difference Result 3170 states and 4014 transitions. [2022-07-12 13:03:10,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 13:03:10,002 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 13 states have internal predecessors, (74), 4 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 84 [2022-07-12 13:03:10,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:03:10,009 INFO L225 Difference]: With dead ends: 3170 [2022-07-12 13:03:10,009 INFO L226 Difference]: Without dead ends: 1727 [2022-07-12 13:03:10,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2022-07-12 13:03:10,015 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 709 mSDsluCounter, 2418 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:03:10,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2749 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 13:03:10,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2022-07-12 13:03:10,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 412. [2022-07-12 13:03:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 317 states have (on average 1.2397476340694007) internal successors, (393), 317 states have internal predecessors, (393), 55 states have call successors, (55), 40 states have call predecessors, (55), 39 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-12 13:03:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 502 transitions. [2022-07-12 13:03:10,042 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 502 transitions. Word has length 84 [2022-07-12 13:03:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:03:10,056 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 502 transitions. [2022-07-12 13:03:10,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 13 states have internal predecessors, (74), 4 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-12 13:03:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 502 transitions. [2022-07-12 13:03:10,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-12 13:03:10,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:03:10,058 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:03:10,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-12 13:03:10,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 13:03:10,273 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:03:10,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:03:10,273 INFO L85 PathProgramCache]: Analyzing trace with hash -446383630, now seen corresponding path program 1 times [2022-07-12 13:03:10,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 13:03:10,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4295522] [2022-07-12 13:03:10,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:03:10,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 13:03:10,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 13:03:10,276 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) [2022-07-12 13:03:10,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 13:03:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:03:10,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 13:03:10,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:03:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 13:03:10,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:03:10,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 13:03:10,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4295522] [2022-07-12 13:03:10,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4295522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:03:10,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:03:10,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 13:03:10,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645483846] [2022-07-12 13:03:10,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:03:10,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 13:03:10,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 13:03:10,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 13:03:10,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 13:03:10,539 INFO L87 Difference]: Start difference. First operand 412 states and 502 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 13:03:10,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:03:10,628 INFO L93 Difference]: Finished difference Result 1001 states and 1214 transitions. [2022-07-12 13:03:10,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 13:03:10,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 92 [2022-07-12 13:03:10,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:03:10,631 INFO L225 Difference]: With dead ends: 1001 [2022-07-12 13:03:10,631 INFO L226 Difference]: Without dead ends: 616 [2022-07-12 13:03:10,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 13:03:10,633 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 233 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:03:10,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 677 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 13:03:10,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-07-12 13:03:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2022-07-12 13:03:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 467 states have (on average 1.220556745182013) internal successors, (570), 467 states have internal predecessors, (570), 81 states have call successors, (81), 65 states have call predecessors, (81), 64 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2022-07-12 13:03:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 731 transitions. [2022-07-12 13:03:10,655 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 731 transitions. Word has length 92 [2022-07-12 13:03:10,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:03:10,655 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 731 transitions. [2022-07-12 13:03:10,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 13:03:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 731 transitions. [2022-07-12 13:03:10,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-12 13:03:10,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:03:10,657 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:03:10,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 13:03:10,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 13:03:10,870 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:03:10,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:03:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1210197595, now seen corresponding path program 1 times [2022-07-12 13:03:10,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 13:03:10,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002199127] [2022-07-12 13:03:10,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:03:10,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 13:03:10,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 13:03:10,873 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) [2022-07-12 13:03:10,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 13:03:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 13:03:11,254 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 13:03:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 13:03:11,694 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-12 13:03:11,694 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 13:03:11,695 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 13:03:11,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 13:03:11,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 13:03:11,921 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:03:11,923 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 13:03:11,948 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,949 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,949 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,949 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,949 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,950 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,950 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,950 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,951 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,951 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,951 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,951 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,952 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,952 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,952 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,952 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,952 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,953 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,953 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,953 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,953 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,954 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,954 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,954 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,954 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,954 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,955 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,955 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,955 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,955 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,955 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,956 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,956 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,956 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,956 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,958 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,958 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,958 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,958 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,958 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,959 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,959 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,959 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,959 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,959 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,960 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,960 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,960 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,960 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,960 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,961 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,961 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,962 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,962 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,962 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,962 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,962 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,963 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,963 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,963 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,963 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,963 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,964 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,964 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,964 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,964 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,964 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,965 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,965 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,965 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,965 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,965 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,966 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,966 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,966 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,966 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,966 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,966 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,967 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,967 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,967 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,967 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,967 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,968 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,968 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,968 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,968 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,968 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,969 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,969 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,969 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,969 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,969 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,970 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,970 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,970 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,970 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,971 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,971 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,971 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,971 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,971 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,972 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,972 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,972 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,972 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,972 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,972 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,973 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,973 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,973 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,973 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,973 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,974 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,974 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,974 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,974 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,974 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,975 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,975 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,975 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,975 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,975 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,976 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,976 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,976 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,976 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,977 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,977 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,977 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,977 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,977 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,977 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,978 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,978 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,978 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,978 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,978 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,979 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,979 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,979 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,979 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,980 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,980 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,980 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,980 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,980 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,981 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,981 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,981 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,981 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,981 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,981 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:11,982 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 13:03:11,982 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 13:03:12,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 01:03:12 BoogieIcfgContainer [2022-07-12 13:03:12,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 13:03:12,095 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 13:03:12,095 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 13:03:12,096 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 13:03:12,096 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:02:52" (3/4) ... [2022-07-12 13:03:12,099 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 13:03:12,099 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 13:03:12,099 INFO L158 Benchmark]: Toolchain (without parser) took 24377.83ms. Allocated memory was 56.6MB in the beginning and 182.5MB in the end (delta: 125.8MB). Free memory was 37.4MB in the beginning and 85.2MB in the end (delta: -47.9MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2022-07-12 13:03:12,100 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 46.1MB. Free memory was 28.5MB in the beginning and 28.5MB in the end (delta: 33.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 13:03:12,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1099.53ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 37.0MB in the beginning and 41.1MB in the end (delta: -4.0MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2022-07-12 13:03:12,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.29ms. Allocated memory is still 73.4MB. Free memory was 41.1MB in the beginning and 35.4MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 13:03:12,101 INFO L158 Benchmark]: Boogie Preprocessor took 106.38ms. Allocated memory is still 73.4MB. Free memory was 35.4MB in the beginning and 39.6MB in the end (delta: -4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 13:03:12,102 INFO L158 Benchmark]: RCFGBuilder took 3516.73ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 39.6MB in the beginning and 57.3MB in the end (delta: -17.7MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2022-07-12 13:03:12,102 INFO L158 Benchmark]: TraceAbstraction took 19527.17ms. Allocated memory was 96.5MB in the beginning and 182.5MB in the end (delta: 86.0MB). Free memory was 56.7MB in the beginning and 85.2MB in the end (delta: -28.5MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2022-07-12 13:03:12,102 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 182.5MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 13:03:12,110 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.20ms. Allocated memory is still 46.1MB. Free memory was 28.5MB in the beginning and 28.5MB in the end (delta: 33.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1099.53ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 37.0MB in the beginning and 41.1MB in the end (delta: -4.0MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.29ms. Allocated memory is still 73.4MB. Free memory was 41.1MB in the beginning and 35.4MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.38ms. Allocated memory is still 73.4MB. Free memory was 35.4MB in the beginning and 39.6MB in the end (delta: -4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 3516.73ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 39.6MB in the beginning and 57.3MB in the end (delta: -17.7MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19527.17ms. Allocated memory was 96.5MB in the beginning and 182.5MB in the end (delta: 86.0MB). Free memory was 56.7MB in the beginning and 85.2MB in the end (delta: -28.5MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 182.5MB. Free memory is still 85.2MB. 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#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1672]: 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 2227. Possible FailurePath: [L1695] int ldv_irq_1_2 = 0; [L1696] int LDV_IN_INTERRUPT = 1; [L1697] int ldv_irq_1_3 = 0; [L1698] struct platform_device *tegra_rtc_driver_group0 ; [L1699] void *ldv_irq_data_1_1 ; [L1700] int ldv_irq_1_1 = 0; [L1701] int ldv_irq_1_0 = 0; [L1702] int ldv_irq_line_1_3 ; [L1703] void *ldv_irq_data_1_0 ; [L1704] int ldv_state_variable_0 ; [L1705] struct device *tegra_rtc_ops_group1 ; [L1706] int ldv_state_variable_3 ; [L1707] int ldv_irq_line_1_0 ; [L1708] int ldv_state_variable_2 ; [L1709] void *ldv_irq_data_1_3 ; [L1710] int ref_cnt ; [L1711] int ldv_irq_line_1_1 ; [L1712] struct rtc_time *tegra_rtc_ops_group0 ; [L1713] void *ldv_irq_data_1_2 ; [L1714] int ldv_state_variable_1 ; [L1715] int ldv_irq_line_1_2 ; [L1716] struct rtc_wkalrm *tegra_rtc_ops_group2 ; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2243] int ldv_retval_2 ; [L2244] int ldv_retval_0 ; [L2246] int ldv_retval_1 ; [L2769] int ldv_init = 0; VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2398] struct seq_file *ldvarg1 ; [L2399] void *tmp ; [L2400] unsigned int ldvarg0 ; [L2401] unsigned int tmp___0 ; [L2402] pm_message_t ldvarg2 ; [L2403] int tmp___1 ; [L2404] int tmp___2 ; [L2405] int tmp___3 ; [L2406] int tmp___4 ; VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg2={22:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2408] CALL, EXPR ldv_zalloc(136U) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1636] void *p ; [L1637] void *tmp ; [L1638] int tmp___0 ; [L1640] tmp___0 = __VERIFIER_nondet_int() [L1641] COND TRUE tmp___0 != 0 [L1642] return (0); VAL [\old(size)=136, \result={0:0}, __this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, size=136, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___0=2147483648] [L2408] RET, EXPR ldv_zalloc(136U) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_zalloc(136U)={0:0}, ldvarg2={22:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2408] tmp = ldv_zalloc(136U) [L2409] ldvarg1 = (struct seq_file *)tmp [L2410] tmp___0 = __VERIFIER_nondet_uint() [L2411] ldvarg0 = tmp___0 [L2412] FCALL ldv_initialize() [L2413] FCALL memset((void *)(& ldvarg2), 0, 4U) [L2414] ldv_state_variable_1 = 1 [L2415] ref_cnt = 0 [L2416] ldv_state_variable_0 = 1 [L2417] ldv_state_variable_3 = 0 [L2418] ldv_state_variable_2 = 0 VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5] [L2420] tmp___1 = __VERIFIER_nondet_int() [L2422] case 0: [L2428] case 1: VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=1] [L2429] COND TRUE ldv_state_variable_0 != 0 [L2430] tmp___2 = __VERIFIER_nondet_int() [L2432] case 0: [L2440] case 1: VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=1, tmp___2=1] [L2441] COND TRUE ldv_state_variable_0 == 1 [L2442] CALL, EXPR tegra_rtc_init() [L2230] int tmp ; [L2232] CALL, EXPR platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2848] return __VERIFIER_nondet_int(); [L2232] RET, EXPR platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2232] tmp = platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2233] return (tmp); VAL [\result=0, __this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp=0] [L2442] RET, EXPR tegra_rtc_init() [L2442] ldv_retval_0 = tegra_rtc_init() [L2443] COND TRUE ldv_retval_0 == 0 [L2444] ldv_state_variable_0 = 3 [L2445] ldv_state_variable_2 = 1 [L2446] CALL ldv_initialize_platform_driver_2() [L2363] void *tmp ; VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2365] CALL, EXPR ldv_zalloc(624U) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1636] void *p ; [L1637] void *tmp ; [L1638] int tmp___0 ; [L1640] tmp___0 = __VERIFIER_nondet_int() [L1641] COND TRUE tmp___0 != 0 [L1642] return (0); VAL [\old(size)=624, \result={0:0}, __this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ref_cnt=0, size=624, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___0=2147483648] [L2365] RET, EXPR ldv_zalloc(624U) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_zalloc(624U)={0:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2365] tmp = ldv_zalloc(624U) [L2366] tegra_rtc_driver_group0 = (struct platform_device *)tmp VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}] [L2446] RET ldv_initialize_platform_driver_2() [L2449] COND FALSE !(ldv_retval_0 != 0) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=1, tmp___2=1] [L2420] tmp___1 = __VERIFIER_nondet_int() [L2422] case 0: [L2428] case 1: [L2464] case 2: [L2558] case 3: VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=3, tmp___2=1] [L2559] COND TRUE ldv_state_variable_2 != 0 [L2560] tmp___4 = __VERIFIER_nondet_int() [L2562] case 0: [L2574] case 1: [L2584] case 2: [L2604] case 3: [L2614] case 4: VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=3, tmp___2=1, tmp___4=4] [L2615] COND TRUE ldv_state_variable_2 == 1 [L2616] CALL ldv_probe_2() [L2836] return __VERIFIER_nondet_int(); [L2616] RET ldv_probe_2() [L2617] ldv_state_variable_2 = 2 [L2618] ref_cnt = ref_cnt + 1 VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=3, tmp___2=1, tmp___4=4] [L2420] tmp___1 = __VERIFIER_nondet_int() [L2422] case 0: [L2428] case 1: [L2464] case 2: [L2558] case 3: VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=3, tmp___2=1, tmp___4=4] [L2559] COND TRUE ldv_state_variable_2 != 0 [L2560] tmp___4 = __VERIFIER_nondet_int() [L2562] case 0: VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=3, tmp___2=1, tmp___4=0] [L2563] COND FALSE !(ldv_state_variable_2 == 4) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=3, tmp___2=1, tmp___4=0] [L2568] COND TRUE ldv_state_variable_2 == 2 VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ldvarg0=5, ldvarg1={0:0}, ldvarg2={22:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___0=5, tmp___1=3, tmp___2=1, tmp___4=0] [L2569] CALL tegra_rtc_shutdown(tegra_rtc_driver_group0) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, pdev={0:0}, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2222] CALL tegra_rtc_alarm_irq_enable(& pdev->dev, 0U) VAL [\old(enabled)=0, __this_module={0:0}, dev={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1960] struct tegra_rtc_info *info ; [L1961] void *tmp ; [L1962] unsigned int status ; [L1963] unsigned long sl_irq_flags ; [L1964] u32 __v ; [L1965] u32 __v___0 ; VAL [\old(enabled)=0, __this_module={0:0}, dev={0:12}, dev={0:12}, enabled=0, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1967] CALL, EXPR dev_get_drvdata((struct device const *)dev) VAL [__this_module={0:0}, arg0={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2807] CALL, EXPR ldv_malloc(0UL) VAL [\old(size)=0, __this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1618] void *p ; [L1619] void *tmp ; [L1620] int tmp___0 ; [L1622] tmp___0 = __VERIFIER_nondet_int() [L1623] COND TRUE tmp___0 != 0 [L1624] return (0); VAL [\old(size)=0, \result={0:0}, __this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, size=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___0=2147483648] [L2807] RET, EXPR ldv_malloc(0UL) VAL [__this_module={0:0}, arg0={0:12}, arg0={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_malloc(0UL)={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2807] return ldv_malloc(0UL); [L1967] RET, EXPR dev_get_drvdata((struct device const *)dev) VAL [\old(enabled)=0, __this_module={0:0}, dev={0:12}, dev={0:12}, dev_get_drvdata((struct device const *)dev)={0:0}, enabled=0, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1967] tmp = dev_get_drvdata((struct device const *)dev) [L1968] info = (struct tegra_rtc_info *)tmp VAL [\old(enabled)=0, __this_module={0:0}, dev={0:12}, dev={0:12}, enabled=0, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}] [L1969] CALL tegra_rtc_wait_while_busy(dev) VAL [__this_module={0:0}, dev={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1843] struct tegra_rtc_info *info ; [L1844] void *tmp ; [L1845] int retries ; [L1846] int tmp___0 ; [L1847] u32 tmp___1 ; VAL [__this_module={0:0}, dev={0:12}, dev={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1849] CALL, EXPR dev_get_drvdata((struct device const *)dev) VAL [__this_module={0:0}, arg0={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2807] CALL, EXPR ldv_malloc(0UL) VAL [\old(size)=0, __this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1618] void *p ; [L1619] void *tmp ; [L1620] int tmp___0 ; [L1622] tmp___0 = __VERIFIER_nondet_int() [L1623] COND TRUE tmp___0 != 0 [L1624] return (0); VAL [\old(size)=0, \result={0:0}, __this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, size=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___0=2147483648] [L2807] RET, EXPR ldv_malloc(0UL) VAL [__this_module={0:0}, arg0={0:12}, arg0={0:12}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_malloc(0UL)={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2807] return ldv_malloc(0UL); [L1849] RET, EXPR dev_get_drvdata((struct device const *)dev) VAL [__this_module={0:0}, dev={0:12}, dev={0:12}, dev_get_drvdata((struct device const *)dev)={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1849] tmp = dev_get_drvdata((struct device const *)dev) [L1850] info = (struct tegra_rtc_info *)tmp [L1851] retries = 500 VAL [__this_module={0:0}, dev={0:12}, dev={0:12}, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, retries=500, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}] [L1862] CALL, EXPR tegra_rtc_check_busy(info) [L1833] u32 __v ; [L1834] u32 __v___0 ; [L1836] EXPR info->rtc_base [L1836] EXPR (unsigned int volatile *)info->rtc_base + 4U [L1836] __v___0 = *((unsigned int volatile *)info->rtc_base + 4U) [L1837] __v = __v___0 [L1838] return (__v & 1U); VAL [\result=0, __this_module={0:0}, __v=0, __v___0=0, info={0:0}, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1862] RET, EXPR tegra_rtc_check_busy(info) [L1862] tmp___1 = tegra_rtc_check_busy(info) [L1863] COND FALSE !(tmp___1 != 0U) [L1867] return (0); VAL [\result=0, __this_module={0:0}, dev={0:12}, dev={0:12}, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, retries=500, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp={0:0}, tmp___1=0] [L1969] RET tegra_rtc_wait_while_busy(dev) VAL [\old(enabled)=0, __this_module={0:0}, dev={0:12}, dev={0:12}, enabled=0, info={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tegra_rtc_wait_while_busy(dev)=0, tmp={0:0}] [L1970] CALL ldv_spin_lock_check() VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2783] COND FALSE !(ldv_init == 1) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2785] CALL ldv_error() VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1672] reach_error() VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=2, ldv_state_variable_3=0, ref_cnt=1, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 32 procedures, 382 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5496 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5457 mSDsluCounter, 21173 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15383 mSDsCounter, 845 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2819 IncrementalHoareTripleChecker+Invalid, 3664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 845 mSolverCounterUnsat, 5790 mSDtfsCounter, 2819 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1436 GetRequests, 1297 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1470occurred in iteration=13, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 2191 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1061 NumberOfCodeBlocks, 1057 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1360 ConstructedInterpolants, 0 QuantifiedInterpolants, 2630 SizeOfPredicates, 34 NumberOfNonLiveVariables, 5292 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 392/455 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-12 13:03:12,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample