./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--block--paride--pg.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--block--paride--pg.ko-entry_point.cil.out.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 86380eb8807c8834472c3c5bc5f358e156df083f7e4b141cf7faa18b94c9fafb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 15:22:29,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 15:22:29,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 15:22:29,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 15:22:29,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 15:22:29,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 15:22:29,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 15:22:29,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 15:22:29,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 15:22:29,981 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 15:22:29,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 15:22:29,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 15:22:29,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 15:22:29,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 15:22:29,982 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 15:22:29,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 15:22:29,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 15:22:29,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 15:22:29,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 15:22:29,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 15:22:29,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 15:22:29,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 15:22:29,987 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 15:22:29,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 15:22:29,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 15:22:29,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 15:22:29,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 15:22:29,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 15:22:29,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 15:22:29,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:22:29,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 15:22:29,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 15:22:29,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 15:22:29,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 15:22:29,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 15:22:29,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 15:22:29,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 15:22:29,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 15:22:29,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 15:22:29,990 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 86380eb8807c8834472c3c5bc5f358e156df083f7e4b141cf7faa18b94c9fafb [2024-10-11 15:22:30,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 15:22:30,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 15:22:30,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 15:22:30,227 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 15:22:30,227 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 15:22:30,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--block--paride--pg.ko-entry_point.cil.out.i [2024-10-11 15:22:31,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 15:22:31,685 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 15:22:31,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--block--paride--pg.ko-entry_point.cil.out.i [2024-10-11 15:22:31,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8ad27e2d6/dd49a55c118d454fa7252d8b2cd91dc8/FLAGc960dae28 [2024-10-11 15:22:31,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8ad27e2d6/dd49a55c118d454fa7252d8b2cd91dc8 [2024-10-11 15:22:31,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 15:22:31,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 15:22:31,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 15:22:31,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 15:22:31,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 15:22:31,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:22:31" (1/1) ... [2024-10-11 15:22:31,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@367dbd89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:31, skipping insertion in model container [2024-10-11 15:22:31,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:22:31" (1/1) ... [2024-10-11 15:22:32,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 15:22:32,338 WARN L1336 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3070] [2024-10-11 15:22:32,339 WARN L1336 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3071-3072] [2024-10-11 15:22:32,416 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--block--paride--pg.ko-entry_point.cil.out.i[91143,91156] [2024-10-11 15:22:32,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:22:32,678 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 15:22:32,720 WARN L1336 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3070] [2024-10-11 15:22:32,721 WARN L1336 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3071-3072] [2024-10-11 15:22:32,722 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [3152] [2024-10-11 15:22:32,723 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %2, %0; setc %1": "+m" (*addr), "=qm" (c): "Ir" (nr): "memory"); [3160-3161] [2024-10-11 15:22:32,728 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--block--paride--pg.ko-entry_point.cil.out.i[91143,91156] [2024-10-11 15:22:32,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:22:32,822 INFO L204 MainTranslator]: Completed translation [2024-10-11 15:22:32,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:32 WrapperNode [2024-10-11 15:22:32,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 15:22:32,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 15:22:32,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 15:22:32,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 15:22:32,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:32" (1/1) ... [2024-10-11 15:22:32,857 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:32" (1/1) ... [2024-10-11 15:22:32,906 INFO L138 Inliner]: procedures = 111, calls = 515, calls flagged for inlining = 42, calls inlined = 40, statements flattened = 1283 [2024-10-11 15:22:32,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 15:22:32,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 15:22:32,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 15:22:32,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 15:22:32,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:32" (1/1) ... [2024-10-11 15:22:32,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:32" (1/1) ... [2024-10-11 15:22:32,936 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:32" (1/1) ... [2024-10-11 15:22:33,006 INFO L175 MemorySlicer]: Split 258 memory accesses to 20 slices as follows [2, 5, 32, 22, 1, 29, 96, 2, 3, 14, 6, 5, 6, 13, 5, 5, 1, 2, 6, 3]. 37 percent of accesses are in the largest equivalence class. The 135 initializations are split as follows [2, 5, 24, 22, 1, 29, 0, 0, 0, 14, 0, 5, 6, 13, 0, 5, 0, 0, 6, 3]. The 55 writes are split as follows [0, 0, 0, 0, 0, 0, 42, 1, 2, 0, 2, 0, 0, 0, 5, 0, 1, 2, 0, 0]. [2024-10-11 15:22:33,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:32" (1/1) ... [2024-10-11 15:22:33,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:32" (1/1) ... [2024-10-11 15:22:33,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:32" (1/1) ... [2024-10-11 15:22:33,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:32" (1/1) ... [2024-10-11 15:22:33,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:32" (1/1) ... [2024-10-11 15:22:33,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:32" (1/1) ... [2024-10-11 15:22:33,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 15:22:33,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 15:22:33,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 15:22:33,131 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 15:22:33,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:32" (1/1) ... [2024-10-11 15:22:33,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:22:33,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:22:33,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 15:22:33,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 15:22:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2024-10-11 15:22:33,197 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2024-10-11 15:22:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2024-10-11 15:22:33,198 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2024-10-11 15:22:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2024-10-11 15:22:33,199 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2024-10-11 15:22:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2024-10-11 15:22:33,199 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2024-10-11 15:22:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-11 15:22:33,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-11 15:22:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 15:22:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 15:22:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 15:22:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 15:22:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 15:22:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 15:22:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 15:22:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 15:22:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 15:22:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 15:22:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 15:22:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 15:22:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 15:22:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-11 15:22:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-11 15:22:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-11 15:22:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-10-11 15:22:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-10-11 15:22:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2024-10-11 15:22:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2024-10-11 15:22:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2024-10-11 15:22:33,203 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2024-10-11 15:22:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 15:22:33,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 15:22:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure pg_sleep [2024-10-11 15:22:33,204 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_sleep [2024-10-11 15:22:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure pg_completion [2024-10-11 15:22:33,204 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_completion [2024-10-11 15:22:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 15:22:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 15:22:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 15:22:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 15:22:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 15:22:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 15:22:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 15:22:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 15:22:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 15:22:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 15:22:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 15:22:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 15:22:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 15:22:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-11 15:22:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-11 15:22:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-11 15:22:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-10-11 15:22:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-10-11 15:22:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2024-10-11 15:22:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2024-10-11 15:22:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2024-10-11 15:22:33,207 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2024-10-11 15:22:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure pg_wait [2024-10-11 15:22:33,207 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_wait [2024-10-11 15:22:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-11 15:22:33,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-11 15:22:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-11 15:22:33,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-11 15:22:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2024-10-11 15:22:33,208 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2024-10-11 15:22:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 15:22:33,208 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 15:22:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 15:22:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2024-10-11 15:22:33,209 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2024-10-11 15:22:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 15:22:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 15:22:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 15:22:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 15:22:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 15:22:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 15:22:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 15:22:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 15:22:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 15:22:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 15:22:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-11 15:22:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-11 15:22:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-11 15:22:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-11 15:22:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-11 15:22:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-11 15:22:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-10-11 15:22:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-10-11 15:22:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-10-11 15:22:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2024-10-11 15:22:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2024-10-11 15:22:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2024-10-11 15:22:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure DRIVE [2024-10-11 15:22:33,211 INFO L138 BoogieDeclarations]: Found implementation of procedure DRIVE [2024-10-11 15:22:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure pg_write [2024-10-11 15:22:33,211 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_write [2024-10-11 15:22:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2024-10-11 15:22:33,211 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2024-10-11 15:22:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 15:22:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 15:22:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 15:22:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 15:22:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 15:22:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 15:22:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 15:22:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 15:22:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-11 15:22:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-11 15:22:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-11 15:22:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-11 15:22:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-11 15:22:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-11 15:22:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-10-11 15:22:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-10-11 15:22:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-10-11 15:22:33,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2024-10-11 15:22:33,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2024-10-11 15:22:33,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2024-10-11 15:22:33,213 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_20 [2024-10-11 15:22:33,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_20 [2024-10-11 15:22:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure pg_reset [2024-10-11 15:22:33,215 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_reset [2024-10-11 15:22:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure pg_identify [2024-10-11 15:22:33,215 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_identify [2024-10-11 15:22:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2024-10-11 15:22:33,215 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2024-10-11 15:22:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 15:22:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 15:22:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 15:22:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 15:22:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 15:22:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 15:22:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 15:22:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 15:22:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 15:22:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-11 15:22:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-11 15:22:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-11 15:22:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-11 15:22:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-11 15:22:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-11 15:22:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-10-11 15:22:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-10-11 15:22:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-10-11 15:22:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2024-10-11 15:22:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2024-10-11 15:22:33,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2024-10-11 15:22:33,221 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2024-10-11 15:22:33,221 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2024-10-11 15:22:33,221 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2024-10-11 15:22:33,222 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2024-10-11 15:22:33,222 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2024-10-11 15:22:33,222 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2024-10-11 15:22:33,222 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-10-11 15:22:33,222 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-10-11 15:22:33,222 INFO L130 BoogieDeclarations]: Found specification of procedure pg_probe [2024-10-11 15:22:33,222 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_probe [2024-10-11 15:22:33,222 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2024-10-11 15:22:33,222 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2024-10-11 15:22:33,222 INFO L130 BoogieDeclarations]: Found specification of procedure pg_command [2024-10-11 15:22:33,222 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_command [2024-10-11 15:22:33,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 15:22:33,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 15:22:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 15:22:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 15:22:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 15:22:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 15:22:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 15:22:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 15:22:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 15:22:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 15:22:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 15:22:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 15:22:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 15:22:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 15:22:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 15:22:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 15:22:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 15:22:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 15:22:33,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 15:22:33,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 15:22:33,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-11 15:22:33,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-11 15:22:33,224 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2024-10-11 15:22:33,224 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2024-10-11 15:22:33,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 15:22:33,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 15:22:33,224 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2024-10-11 15:22:33,224 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2024-10-11 15:22:33,224 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2024-10-11 15:22:33,224 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2024-10-11 15:22:33,557 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 15:22:33,559 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 15:22:33,600 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-11 15:22:34,640 INFO L? ?]: Removed 568 outVars from TransFormulas that were not future-live. [2024-10-11 15:22:34,641 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 15:22:34,735 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 15:22:34,735 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 15:22:34,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:22:34 BoogieIcfgContainer [2024-10-11 15:22:34,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 15:22:34,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 15:22:34,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 15:22:34,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 15:22:34,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:22:31" (1/3) ... [2024-10-11 15:22:34,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd26510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:22:34, skipping insertion in model container [2024-10-11 15:22:34,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:32" (2/3) ... [2024-10-11 15:22:34,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd26510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:22:34, skipping insertion in model container [2024-10-11 15:22:34,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:22:34" (3/3) ... [2024-10-11 15:22:34,742 INFO L112 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--block--paride--pg.ko-entry_point.cil.out.i [2024-10-11 15:22:34,754 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 15:22:34,754 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 15:22:34,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 15:22:34,851 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@297e36d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 15:22:34,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 15:22:34,857 INFO L276 IsEmpty]: Start isEmpty. Operand has 481 states, 333 states have (on average 1.4294294294294294) internal successors, (476), 341 states have internal predecessors, (476), 113 states have call successors, (113), 34 states have call predecessors, (113), 33 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-11 15:22:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 15:22:34,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:22:34,880 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:22:34,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:22:34,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:22:34,885 INFO L85 PathProgramCache]: Analyzing trace with hash -384519563, now seen corresponding path program 1 times [2024-10-11 15:22:34,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:22:34,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826545610] [2024-10-11 15:22:34,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:34,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:22:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:22:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:22:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 15:22:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:22:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:22:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 15:22:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 15:22:35,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:22:35,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826545610] [2024-10-11 15:22:35,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826545610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:22:35,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:22:35,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 15:22:35,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528411842] [2024-10-11 15:22:35,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:22:35,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 15:22:35,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:22:35,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 15:22:35,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:22:35,711 INFO L87 Difference]: Start difference. First operand has 481 states, 333 states have (on average 1.4294294294294294) internal successors, (476), 341 states have internal predecessors, (476), 113 states have call successors, (113), 34 states have call predecessors, (113), 33 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 15:22:39,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:22:39,570 INFO L93 Difference]: Finished difference Result 1300 states and 1925 transitions. [2024-10-11 15:22:39,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 15:22:39,572 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2024-10-11 15:22:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:22:39,587 INFO L225 Difference]: With dead ends: 1300 [2024-10-11 15:22:39,587 INFO L226 Difference]: Without dead ends: 787 [2024-10-11 15:22:39,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2024-10-11 15:22:39,595 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 927 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 3137 mSolverCounterSat, 665 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 3802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 665 IncrementalHoareTripleChecker+Valid, 3137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:22:39,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 1868 Invalid, 3802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [665 Valid, 3137 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-11 15:22:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-10-11 15:22:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 751. [2024-10-11 15:22:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 517 states have (on average 1.377176015473888) internal successors, (712), 522 states have internal predecessors, (712), 175 states have call successors, (175), 57 states have call predecessors, (175), 58 states have return successors, (182), 176 states have call predecessors, (182), 174 states have call successors, (182) [2024-10-11 15:22:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1069 transitions. [2024-10-11 15:22:39,708 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1069 transitions. Word has length 90 [2024-10-11 15:22:39,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:22:39,710 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1069 transitions. [2024-10-11 15:22:39,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 15:22:39,710 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1069 transitions. [2024-10-11 15:22:39,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 15:22:39,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:22:39,720 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:22:39,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 15:22:39,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:22:39,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:22:39,721 INFO L85 PathProgramCache]: Analyzing trace with hash 270743577, now seen corresponding path program 1 times [2024-10-11 15:22:39,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:22:39,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851303392] [2024-10-11 15:22:39,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:39,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:22:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:39,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:39,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:22:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:39,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:39,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:22:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:39,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 15:22:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:39,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:22:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:39,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:22:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:39,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 15:22:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:39,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 15:22:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:22:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:22:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:22:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 15:22:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:22:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:22:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,164 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-10-11 15:22:40,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:22:40,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851303392] [2024-10-11 15:22:40,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851303392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:22:40,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:22:40,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:22:40,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328294001] [2024-10-11 15:22:40,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:22:40,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:22:40,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:22:40,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:22:40,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:22:40,167 INFO L87 Difference]: Start difference. First operand 751 states and 1069 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 15:22:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:22:42,266 INFO L93 Difference]: Finished difference Result 1523 states and 2183 transitions. [2024-10-11 15:22:42,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:22:42,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 156 [2024-10-11 15:22:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:22:42,272 INFO L225 Difference]: With dead ends: 1523 [2024-10-11 15:22:42,273 INFO L226 Difference]: Without dead ends: 799 [2024-10-11 15:22:42,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:22:42,279 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 352 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 15:22:42,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1045 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 15:22:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-11 15:22:42,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 753. [2024-10-11 15:22:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 519 states have (on average 1.3757225433526012) internal successors, (714), 524 states have internal predecessors, (714), 175 states have call successors, (175), 57 states have call predecessors, (175), 58 states have return successors, (182), 176 states have call predecessors, (182), 174 states have call successors, (182) [2024-10-11 15:22:42,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1071 transitions. [2024-10-11 15:22:42,340 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1071 transitions. Word has length 156 [2024-10-11 15:22:42,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:22:42,341 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1071 transitions. [2024-10-11 15:22:42,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 15:22:42,341 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1071 transitions. [2024-10-11 15:22:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 15:22:42,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:22:42,344 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:22:42,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 15:22:42,344 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:22:42,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:22:42,345 INFO L85 PathProgramCache]: Analyzing trace with hash -907290453, now seen corresponding path program 1 times [2024-10-11 15:22:42,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:22:42,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325077287] [2024-10-11 15:22:42,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:42,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:22:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:22:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:22:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 15:22:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 15:22:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:22:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:22:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 15:22:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 15:22:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:22:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:22:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:22:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 15:22:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:22:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:22:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:42,781 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-10-11 15:22:42,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:22:42,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325077287] [2024-10-11 15:22:42,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325077287] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:22:42,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990288067] [2024-10-11 15:22:42,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:42,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:22:42,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:22:42,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:22:42,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 15:22:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:43,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 1658 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:22:43,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:22:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-11 15:22:43,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:22:43,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990288067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:22:43,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:22:43,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-10-11 15:22:43,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863556427] [2024-10-11 15:22:43,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:22:43,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:22:43,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:22:43,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:22:43,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:22:43,273 INFO L87 Difference]: Start difference. First operand 753 states and 1071 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 15:22:43,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:22:43,395 INFO L93 Difference]: Finished difference Result 1480 states and 2112 transitions. [2024-10-11 15:22:43,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:22:43,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 164 [2024-10-11 15:22:43,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:22:43,400 INFO L225 Difference]: With dead ends: 1480 [2024-10-11 15:22:43,400 INFO L226 Difference]: Without dead ends: 754 [2024-10-11 15:22:43,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:22:43,403 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 0 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:22:43,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1216 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 15:22:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-11 15:22:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-11 15:22:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 520 states have (on average 1.375) internal successors, (715), 525 states have internal predecessors, (715), 175 states have call successors, (175), 57 states have call predecessors, (175), 58 states have return successors, (182), 176 states have call predecessors, (182), 174 states have call successors, (182) [2024-10-11 15:22:43,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1072 transitions. [2024-10-11 15:22:43,434 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1072 transitions. Word has length 164 [2024-10-11 15:22:43,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:22:43,434 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1072 transitions. [2024-10-11 15:22:43,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 15:22:43,435 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1072 transitions. [2024-10-11 15:22:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 15:22:43,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:22:43,437 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:22:43,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 15:22:43,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:22:43,639 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:22:43,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:22:43,639 INFO L85 PathProgramCache]: Analyzing trace with hash 417565741, now seen corresponding path program 1 times [2024-10-11 15:22:43,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:22:43,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129506532] [2024-10-11 15:22:43,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:43,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:22:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:43,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:43,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:22:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:43,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:43,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:22:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:43,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 15:22:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:43,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 15:22:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:43,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:22:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:43,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:22:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:43,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 15:22:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:43,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 15:22:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:43,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:43,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:43,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:22:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:43,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:22:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:43,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:43,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:44,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:44,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:22:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:44,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:44,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 15:22:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:44,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:44,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:22:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:44,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:44,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:22:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:44,034 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-10-11 15:22:44,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:22:44,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129506532] [2024-10-11 15:22:44,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129506532] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:22:44,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31481879] [2024-10-11 15:22:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:44,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:22:44,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:22:44,038 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:22:44,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 15:22:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:44,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 1661 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:22:44,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:22:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-11 15:22:44,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:22:44,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31481879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:22:44,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:22:44,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-10-11 15:22:44,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321639332] [2024-10-11 15:22:44,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:22:44,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:22:44,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:22:44,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:22:44,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:22:44,544 INFO L87 Difference]: Start difference. First operand 754 states and 1072 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 15:22:44,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:22:44,646 INFO L93 Difference]: Finished difference Result 758 states and 1076 transitions. [2024-10-11 15:22:44,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:22:44,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 164 [2024-10-11 15:22:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:22:44,651 INFO L225 Difference]: With dead ends: 758 [2024-10-11 15:22:44,651 INFO L226 Difference]: Without dead ends: 755 [2024-10-11 15:22:44,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:22:44,652 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 0 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:22:44,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1212 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 15:22:44,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-10-11 15:22:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2024-10-11 15:22:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 521 states have (on average 1.3742802303262955) internal successors, (716), 526 states have internal predecessors, (716), 175 states have call successors, (175), 57 states have call predecessors, (175), 58 states have return successors, (182), 176 states have call predecessors, (182), 174 states have call successors, (182) [2024-10-11 15:22:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1073 transitions. [2024-10-11 15:22:44,686 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1073 transitions. Word has length 164 [2024-10-11 15:22:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:22:44,688 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1073 transitions. [2024-10-11 15:22:44,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 15:22:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1073 transitions. [2024-10-11 15:22:44,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 15:22:44,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:22:44,692 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:22:44,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 15:22:44,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:22:44,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:22:44,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:22:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1874848961, now seen corresponding path program 1 times [2024-10-11 15:22:44,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:22:44,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418147945] [2024-10-11 15:22:44,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:44,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:22:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:22:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:22:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 15:22:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 15:22:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:22:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:22:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 15:22:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 15:22:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:22:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:22:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:22:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 15:22:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:22:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:22:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-10-11 15:22:45,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:22:45,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418147945] [2024-10-11 15:22:45,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418147945] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:22:45,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351957457] [2024-10-11 15:22:45,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:45,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:22:45,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:22:45,249 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:22:45,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 15:22:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:45,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 1666 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:22:45,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:22:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-11 15:22:45,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:22:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351957457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:22:45,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:22:45,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-10-11 15:22:45,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854949027] [2024-10-11 15:22:45,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:22:45,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:22:45,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:22:45,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:22:45,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:22:45,726 INFO L87 Difference]: Start difference. First operand 755 states and 1073 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 15:22:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:22:45,833 INFO L93 Difference]: Finished difference Result 1505 states and 2150 transitions. [2024-10-11 15:22:45,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:22:45,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 166 [2024-10-11 15:22:45,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:22:45,838 INFO L225 Difference]: With dead ends: 1505 [2024-10-11 15:22:45,838 INFO L226 Difference]: Without dead ends: 777 [2024-10-11 15:22:45,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:22:45,841 INFO L432 NwaCegarLoop]: 611 mSDtfsCounter, 10 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:22:45,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1217 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 15:22:45,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-10-11 15:22:45,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 757. [2024-10-11 15:22:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 523 states have (on average 1.372848948374761) internal successors, (718), 528 states have internal predecessors, (718), 175 states have call successors, (175), 57 states have call predecessors, (175), 58 states have return successors, (182), 176 states have call predecessors, (182), 174 states have call successors, (182) [2024-10-11 15:22:45,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1075 transitions. [2024-10-11 15:22:45,872 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1075 transitions. Word has length 166 [2024-10-11 15:22:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:22:45,873 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 1075 transitions. [2024-10-11 15:22:45,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 15:22:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1075 transitions. [2024-10-11 15:22:45,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 15:22:45,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:22:45,877 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:22:45,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 15:22:46,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:22:46,078 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:22:46,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:22:46,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1266246997, now seen corresponding path program 1 times [2024-10-11 15:22:46,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:22:46,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949318610] [2024-10-11 15:22:46,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:46,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:22:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:22:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:22:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 15:22:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 15:22:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 15:22:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:22:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:22:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:22:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 15:22:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:22:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:22:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:22:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 15:22:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:22:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:22:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-10-11 15:22:46,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:22:46,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949318610] [2024-10-11 15:22:46,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949318610] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:22:46,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75307661] [2024-10-11 15:22:46,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:46,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:22:46,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:22:46,438 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:22:46,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 15:22:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:46,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 1708 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:22:46,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:22:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-11 15:22:46,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:22:46,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75307661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:22:46,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:22:46,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-10-11 15:22:46,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685197850] [2024-10-11 15:22:46,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:22:46,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:22:46,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:22:46,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:22:46,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:22:46,925 INFO L87 Difference]: Start difference. First operand 757 states and 1075 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 15:22:47,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:22:47,041 INFO L93 Difference]: Finished difference Result 1501 states and 2140 transitions. [2024-10-11 15:22:47,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:22:47,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 170 [2024-10-11 15:22:47,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:22:47,046 INFO L225 Difference]: With dead ends: 1501 [2024-10-11 15:22:47,046 INFO L226 Difference]: Without dead ends: 771 [2024-10-11 15:22:47,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:22:47,049 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 14 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:22:47,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1201 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 15:22:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-10-11 15:22:47,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 759. [2024-10-11 15:22:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 525 states have (on average 1.3714285714285714) internal successors, (720), 530 states have internal predecessors, (720), 175 states have call successors, (175), 57 states have call predecessors, (175), 58 states have return successors, (182), 176 states have call predecessors, (182), 174 states have call successors, (182) [2024-10-11 15:22:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1077 transitions. [2024-10-11 15:22:47,094 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1077 transitions. Word has length 170 [2024-10-11 15:22:47,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:22:47,096 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1077 transitions. [2024-10-11 15:22:47,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 15:22:47,096 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1077 transitions. [2024-10-11 15:22:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 15:22:47,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:22:47,099 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:22:47,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 15:22:47,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-11 15:22:47,300 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:22:47,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:22:47,301 INFO L85 PathProgramCache]: Analyzing trace with hash 543510018, now seen corresponding path program 1 times [2024-10-11 15:22:47,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:22:47,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502934973] [2024-10-11 15:22:47,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:47,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:22:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:22:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:22:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 15:22:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 15:22:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 15:22:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:22:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:22:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:22:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 15:22:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:22:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:22:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:22:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 15:22:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:22:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:22:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-11 15:22:47,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:22:47,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502934973] [2024-10-11 15:22:47,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502934973] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:22:47,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154268406] [2024-10-11 15:22:47,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:47,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:22:47,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:22:47,618 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:22:47,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 15:22:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 1719 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 15:22:48,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:22:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-11 15:22:48,156 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:22:48,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154268406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:22:48,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:22:48,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-10-11 15:22:48,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896226151] [2024-10-11 15:22:48,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:22:48,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:22:48,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:22:48,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:22:48,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:22:48,157 INFO L87 Difference]: Start difference. First operand 759 states and 1077 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-10-11 15:22:48,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:22:48,260 INFO L93 Difference]: Finished difference Result 1515 states and 2162 transitions. [2024-10-11 15:22:48,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:22:48,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 173 [2024-10-11 15:22:48,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:22:48,265 INFO L225 Difference]: With dead ends: 1515 [2024-10-11 15:22:48,265 INFO L226 Difference]: Without dead ends: 783 [2024-10-11 15:22:48,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:22:48,267 INFO L432 NwaCegarLoop]: 607 mSDtfsCounter, 16 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:22:48,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1200 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 15:22:48,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-10-11 15:22:48,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2024-10-11 15:22:48,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 543 states have (on average 1.3738489871086557) internal successors, (746), 548 states have internal predecessors, (746), 181 states have call successors, (181), 57 states have call predecessors, (181), 58 states have return successors, (188), 182 states have call predecessors, (188), 180 states have call successors, (188) [2024-10-11 15:22:48,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1115 transitions. [2024-10-11 15:22:48,292 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1115 transitions. Word has length 173 [2024-10-11 15:22:48,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:22:48,292 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1115 transitions. [2024-10-11 15:22:48,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-10-11 15:22:48,292 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1115 transitions. [2024-10-11 15:22:48,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 15:22:48,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:22:48,295 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:22:48,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 15:22:48,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:22:48,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:22:48,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:22:48,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1679157541, now seen corresponding path program 1 times [2024-10-11 15:22:48,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:22:48,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964501434] [2024-10-11 15:22:48,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:48,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:22:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:22:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:22:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 15:22:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 15:22:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 15:22:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:22:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 15:22:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 15:22:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:22:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 15:22:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:22:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:22:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:22:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 15:22:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:22:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:22:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-11 15:22:48,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:22:48,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964501434] [2024-10-11 15:22:48,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964501434] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:22:48,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602272605] [2024-10-11 15:22:48,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:48,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:22:48,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:22:48,861 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:22:48,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 15:22:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:49,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 1736 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 15:22:49,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:22:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-11 15:22:49,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:22:49,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602272605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:22:49,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:22:49,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-11 15:22:49,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484843121] [2024-10-11 15:22:49,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:22:49,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:22:49,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:22:49,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:22:49,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:22:49,596 INFO L87 Difference]: Start difference. First operand 783 states and 1115 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 15:22:49,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:22:49,718 INFO L93 Difference]: Finished difference Result 1531 states and 2188 transitions. [2024-10-11 15:22:49,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:22:49,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 177 [2024-10-11 15:22:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:22:49,720 INFO L225 Difference]: With dead ends: 1531 [2024-10-11 15:22:49,720 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 15:22:49,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 15:22:49,724 INFO L432 NwaCegarLoop]: 597 mSDtfsCounter, 513 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:22:49,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1193 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 15:22:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 15:22:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 15:22:49,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 15:22:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 15:22:49,726 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2024-10-11 15:22:49,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:22:49,726 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 15:22:49,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 15:22:49,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 15:22:49,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 15:22:49,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 15:22:49,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 15:22:49,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 15:22:49,933 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:22:49,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 15:22:51,363 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 15:22:51,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_spin~0 [2024-10-11 15:22:51,386 WARN L155 FloydHoareUtils]: Requires clause for pg_probe contained old-variable. Original clause: (and (= |#memory_int#8| |old(#memory_int#8)|) (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#8.base)| |#memory_$Pointer$#8.base|) (= |old(#memory_$Pointer$#6.offset)| |#memory_$Pointer$#6.offset|) (= |old(#memory_$Pointer$#17.base)| |#memory_$Pointer$#17.base|) (= ~ldv_spin~0 0) (= |old(#memory_$Pointer$#6.base)| |#memory_$Pointer$#6.base|) (= |#memory_$Pointer$#8.offset| |old(#memory_$Pointer$#8.offset)|) (= |#memory_int#6| |old(#memory_int#6)|) (= |old(#valid)| |#valid|) (= |old(#memory_$Pointer$#17.offset)| |#memory_$Pointer$#17.offset|) (= |#memory_int#17| |old(#memory_int#17)|)) Eliminated clause: (= ~ldv_spin~0 0) [2024-10-11 15:22:51,390 WARN L155 FloydHoareUtils]: Requires clause for pg_completion contained old-variable. Original clause: (and (= |old(#memory_$Pointer$#6.offset)| |#memory_$Pointer$#6.offset|) (= ~ldv_spin~0 0) (= |old(#memory_$Pointer$#6.base)| |#memory_$Pointer$#6.base|) (= |#memory_int#6| |old(#memory_int#6)|)) Eliminated clause: (= ~ldv_spin~0 0) [2024-10-11 15:22:51,391 WARN L155 FloydHoareUtils]: Requires clause for pg_wait contained old-variable. Original clause: (and (= |old(#memory_$Pointer$#6.offset)| |#memory_$Pointer$#6.offset|) (= ~ldv_spin~0 0) (= |old(#memory_$Pointer$#6.base)| |#memory_$Pointer$#6.base|) (= |#memory_int#6| |old(#memory_int#6)|)) Eliminated clause: (= ~ldv_spin~0 0) [2024-10-11 15:22:51,393 WARN L155 FloydHoareUtils]: Requires clause for pg_write contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#6.offset)| |#memory_$Pointer$#6.offset|) (= ~ldv_spin~0 0) (= |old(#memory_$Pointer$#6.base)| |#memory_$Pointer$#6.base|) (= |#memory_int#6| |old(#memory_int#6)|) (= |old(#valid)| |#valid|)) Eliminated clause: (= ~ldv_spin~0 0) [2024-10-11 15:22:51,395 WARN L155 FloydHoareUtils]: Requires clause for pg_command contained old-variable. Original clause: (and (= |old(#memory_$Pointer$#6.offset)| |#memory_$Pointer$#6.offset|) (= ~ldv_spin~0 0) (= |old(#memory_$Pointer$#6.base)| |#memory_$Pointer$#6.base|) (= |#memory_int#6| |old(#memory_int#6)|)) Eliminated clause: (= ~ldv_spin~0 0) [2024-10-11 15:22:51,401 WARN L155 FloydHoareUtils]: Requires clause for ldv_unregister_chrdev_20 contained old-variable. Original clause: (or (not (= |old(~ldv_state_variable_1~0)| 0)) (= ~ldv_state_variable_1~0 0)) Eliminated clause: true [2024-10-11 15:22:51,402 WARN L155 FloydHoareUtils]: Requires clause for pg_reset contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= ~ldv_spin~0 0) (= |old(#valid)| |#valid|)) Eliminated clause: (= ~ldv_spin~0 0) [2024-10-11 15:22:51,402 WARN L155 FloydHoareUtils]: Requires clause for ldv_malloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= ~ldv_spin~0 0) (= |old(#valid)| |#valid|)) Eliminated clause: (= ~ldv_spin~0 0) [2024-10-11 15:22:51,403 WARN L155 FloydHoareUtils]: Requires clause for ldv_zalloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= ~ldv_spin~0 0) (= |#memory_int#10| |old(#memory_int#10)|) (= |old(#valid)| |#valid|)) Eliminated clause: (= ~ldv_spin~0 0) [2024-10-11 15:22:51,404 WARN L155 FloydHoareUtils]: Requires clause for xs contained old-variable. Original clause: (and (= |old(#memory_$Pointer$#17.base)| |#memory_$Pointer$#17.base|) (= ~ldv_spin~0 0) (= |old(#memory_$Pointer$#17.offset)| |#memory_$Pointer$#17.offset|) (= |#memory_int#17| |old(#memory_int#17)|)) Eliminated clause: (= ~ldv_spin~0 0) [2024-10-11 15:22:51,406 WARN L155 FloydHoareUtils]: Requires clause for pg_identify contained old-variable. Original clause: (and (= |#memory_int#8| |old(#memory_int#8)|) (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#8.base)| |#memory_$Pointer$#8.base|) (= |old(#memory_$Pointer$#6.offset)| |#memory_$Pointer$#6.offset|) (= |old(#memory_$Pointer$#17.base)| |#memory_$Pointer$#17.base|) (= ~ldv_spin~0 0) (= |old(#memory_$Pointer$#6.base)| |#memory_$Pointer$#6.base|) (= |#memory_$Pointer$#8.offset| |old(#memory_$Pointer$#8.offset)|) (= |#memory_int#6| |old(#memory_int#6)|) (= |old(#valid)| |#valid|) (= |old(#memory_$Pointer$#17.offset)| |#memory_$Pointer$#17.offset|) (= |#memory_int#17| |old(#memory_int#17)|)) Eliminated clause: (= ~ldv_spin~0 0) [2024-10-11 15:22:51,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:22:51 BoogieIcfgContainer [2024-10-11 15:22:51,409 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 15:22:51,410 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 15:22:51,410 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 15:22:51,410 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 15:22:51,410 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:22:34" (3/4) ... [2024-10-11 15:22:51,412 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 15:22:51,414 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure copy_from_user [2024-10-11 15:22:51,414 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure pi_release [2024-10-11 15:22:51,415 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure pi_init [2024-10-11 15:22:51,415 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure write_reg [2024-10-11 15:22:51,415 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure pg_sleep [2024-10-11 15:22:51,415 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure pi_read_regr [2024-10-11 15:22:51,415 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure might_fault [2024-10-11 15:22:51,415 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printk [2024-10-11 15:22:51,415 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure pi_disconnect [2024-10-11 15:22:51,415 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure pg_probe [2024-10-11 15:22:51,415 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure status_reg [2024-10-11 15:22:51,415 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure pg_completion [2024-10-11 15:22:51,415 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure DRIVE [2024-10-11 15:22:51,415 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure copy_to_user [2024-10-11 15:22:51,415 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure pg_wait [2024-10-11 15:22:51,415 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2024-10-11 15:22:51,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure pg_write [2024-10-11 15:22:51,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure pi_connect [2024-10-11 15:22:51,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure _copy_to_user [2024-10-11 15:22:51,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2024-10-11 15:22:51,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure pg_command [2024-10-11 15:22:51,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2024-10-11 15:22:51,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure clear_bit [2024-10-11 15:22:51,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_reg [2024-10-11 15:22:51,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 15:22:51,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_unregister_chrdev_20 [2024-10-11 15:22:51,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure pg_reset [2024-10-11 15:22:51,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-10-11 15:22:51,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2024-10-11 15:22:51,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure _copy_from_user [2024-10-11 15:22:51,417 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure xs [2024-10-11 15:22:51,417 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure pg_identify [2024-10-11 15:22:51,417 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure pi_write_block [2024-10-11 15:22:51,417 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2024-10-11 15:22:51,442 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 266 nodes and edges [2024-10-11 15:22:51,444 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 116 nodes and edges [2024-10-11 15:22:51,446 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2024-10-11 15:22:51,447 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 15:22:51,449 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 15:22:51,450 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 15:22:51,452 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 15:22:51,482 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(ldv_state_variable_1) != 0) || (ldv_state_variable_1 == 0)) [2024-10-11 15:22:51,564 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(ldv_state_variable_1) != 0) || (ldv_state_variable_1 == 0)) [2024-10-11 15:22:51,610 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 15:22:51,613 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 15:22:51,613 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 15:22:51,614 INFO L158 Benchmark]: Toolchain (without parser) took 19668.12ms. Allocated memory was 169.9MB in the beginning and 536.9MB in the end (delta: 367.0MB). Free memory was 113.5MB in the beginning and 323.4MB in the end (delta: -209.9MB). Peak memory consumption was 158.2MB. Max. memory is 16.1GB. [2024-10-11 15:22:51,614 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 96.5MB. Free memory was 60.6MB in the beginning and 60.5MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 15:22:51,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 877.16ms. Allocated memory is still 169.9MB. Free memory was 112.9MB in the beginning and 80.4MB in the end (delta: 32.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 15:22:51,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.06ms. Allocated memory is still 169.9MB. Free memory was 80.4MB in the beginning and 71.0MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 15:22:51,614 INFO L158 Benchmark]: Boogie Preprocessor took 223.40ms. Allocated memory was 169.9MB in the beginning and 228.6MB in the end (delta: 58.7MB). Free memory was 71.0MB in the beginning and 180.8MB in the end (delta: -109.8MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2024-10-11 15:22:51,615 INFO L158 Benchmark]: RCFGBuilder took 1604.96ms. Allocated memory is still 228.6MB. Free memory was 180.8MB in the beginning and 83.7MB in the end (delta: 97.0MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-10-11 15:22:51,615 INFO L158 Benchmark]: TraceAbstraction took 16672.79ms. Allocated memory was 228.6MB in the beginning and 536.9MB in the end (delta: 308.3MB). Free memory was 83.7MB in the beginning and 352.7MB in the end (delta: -269.0MB). Peak memory consumption was 176.7MB. Max. memory is 16.1GB. [2024-10-11 15:22:51,615 INFO L158 Benchmark]: Witness Printer took 203.33ms. Allocated memory is still 536.9MB. Free memory was 352.7MB in the beginning and 323.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 15:22:51,617 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 96.5MB. Free memory was 60.6MB in the beginning and 60.5MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 877.16ms. Allocated memory is still 169.9MB. Free memory was 112.9MB in the beginning and 80.4MB in the end (delta: 32.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.06ms. Allocated memory is still 169.9MB. Free memory was 80.4MB in the beginning and 71.0MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 223.40ms. Allocated memory was 169.9MB in the beginning and 228.6MB in the end (delta: 58.7MB). Free memory was 71.0MB in the beginning and 180.8MB in the end (delta: -109.8MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1604.96ms. Allocated memory is still 228.6MB. Free memory was 180.8MB in the beginning and 83.7MB in the end (delta: 97.0MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16672.79ms. Allocated memory was 228.6MB in the beginning and 536.9MB in the end (delta: 308.3MB). Free memory was 83.7MB in the beginning and 352.7MB in the end (delta: -269.0MB). Peak memory consumption was 176.7MB. Max. memory is 16.1GB. * Witness Printer took 203.33ms. Allocated memory is still 536.9MB. Free memory was 352.7MB in the beginning and 323.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 3152]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [3152] - GenericResultAtLocation [Line: 3160]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %2, %0; setc %1": "+m" (*addr), "=qm" (c): "Ir" (nr): "memory"); [3160-3161] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_spin~0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 3271]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 35 procedures, 482 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1963 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1832 mSDsluCounter, 10152 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5874 mSDsCounter, 894 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5330 IncrementalHoareTripleChecker+Invalid, 6224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 894 mSolverCounterUnsat, 4278 mSDtfsCounter, 5330 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1431 GetRequests, 1368 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=783occurred in iteration=7, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 114 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2274 NumberOfCodeBlocks, 2274 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2260 ConstructedInterpolants, 0 QuantifiedInterpolants, 3536 SizeOfPredicates, 1 NumberOfNonLiveVariables, 10148 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 1186/1192 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4390]: Location Invariant Derived location invariant: ((\old(ldv_state_variable_1) != 0) || (ldv_state_variable_1 == 0)) - InvariantResult [Line: 3607]: Location Invariant Derived location invariant: (ldv_spin == 0) - InvariantResult [Line: 3655]: Location Invariant Derived location invariant: (ldv_spin == 0) - InvariantResult [Line: 4162]: Location Invariant Derived location invariant: (ldv_spin == 0) - InvariantResult [Line: 3634]: Location Invariant Derived location invariant: (ldv_spin == 0) - InvariantResult [Line: 3806]: Location Invariant Derived location invariant: (ldv_spin == 0) - InvariantResult [Line: 3655]: Location Invariant Derived location invariant: (ldv_spin == 0) - InvariantResult [Line: 3506]: Location Invariant Derived location invariant: (ldv_spin == 0) - InvariantResult [Line: 3447]: Loop Invariant Derived loop invariant: (ldv_spin == 0) - InvariantResult [Line: 3477]: Location Invariant Derived location invariant: (ldv_spin == 0) - InvariantResult [Line: 3490]: Location Invariant Derived location invariant: (ldv_spin == 0) - InvariantResult [Line: 3274]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 3356]: Procedure Contract for copy_from_user Derived contract for procedure copy_from_user. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 4538]: Procedure Contract for pi_release Derived contract for procedure pi_release. Requires: ((ldv_spin == 0) || (ldv_state_variable_1 == 0)) Ensures: ((ldv_spin == 0) || (ldv_state_variable_1 == 0)) - ProcedureContractResult [Line: 4528]: Procedure Contract for pi_init Derived contract for procedure pi_init. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3477]: Procedure Contract for write_reg Derived contract for procedure write_reg. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3490]: Procedure Contract for pg_sleep Derived contract for procedure pg_sleep. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 4535]: Procedure Contract for pi_read_regr Derived contract for procedure pi_read_regr. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 4508]: Procedure Contract for might_fault Derived contract for procedure might_fault. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 4548]: Procedure Contract for printk Derived contract for procedure printk. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 4524]: Procedure Contract for pi_disconnect Derived contract for procedure pi_disconnect. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3799]: Procedure Contract for pg_probe Derived contract for procedure pg_probe. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3461]: Procedure Contract for status_reg Derived contract for procedure status_reg. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3597]: Procedure Contract for pg_completion Derived contract for procedure pg_completion. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3484]: Procedure Contract for DRIVE Derived contract for procedure DRIVE. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3380]: Procedure Contract for copy_to_user Derived contract for procedure copy_to_user. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3497]: Procedure Contract for pg_wait Derived contract for procedure pg_wait. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3267]: Procedure Contract for ldv_error Derived contract for procedure ldv_error. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 3955]: Procedure Contract for pg_write Derived contract for procedure pg_write. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 4521]: Procedure Contract for pi_connect Derived contract for procedure pi_connect. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 4484]: Procedure Contract for _copy_to_user Derived contract for procedure _copy_to_user. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3545]: Procedure Contract for pg_command Derived contract for procedure pg_command. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3281]: Procedure Contract for ldv__builtin_expect Derived contract for procedure ldv__builtin_expect. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3149]: Procedure Contract for clear_bit Derived contract for procedure clear_bit. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3469]: Procedure Contract for read_reg Derived contract for procedure read_reg. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3211]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 4390]: Procedure Contract for ldv_unregister_chrdev_20 Derived contract for procedure ldv_unregister_chrdev_20. Ensures: (ldv_state_variable_1 == 0) - ProcedureContractResult [Line: 3644]: Procedure Contract for pg_reset Derived contract for procedure pg_reset. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3215]: Procedure Contract for ldv_malloc Derived contract for procedure ldv_malloc. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3233]: Procedure Contract for ldv_zalloc Derived contract for procedure ldv_zalloc. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 4480]: Procedure Contract for _copy_from_user Derived contract for procedure _copy_from_user. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3718]: Procedure Contract for xs Derived contract for procedure xs. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3756]: Procedure Contract for pg_identify Derived contract for procedure pg_identify. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 4541]: Procedure Contract for pi_write_block Derived contract for procedure pi_write_block. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) - ProcedureContractResult [Line: 3176]: Procedure Contract for IS_ERR Derived contract for procedure IS_ERR. Requires: (ldv_spin == 0) Ensures: (ldv_spin == 0) RESULT: Ultimate proved your program to be correct! [2024-10-11 15:22:51,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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: TRUE