./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 32bit --witnessprinter.graph.data.programhash 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 20:42:44,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:42:44,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 20:42:44,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:42:44,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:42:44,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:42:44,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:42:44,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:42:44,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:42:44,884 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:42:44,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:42:44,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:42:44,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:42:44,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:42:44,886 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:42:44,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:42:44,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:42:44,889 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:42:44,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 20:42:44,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:42:44,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:42:44,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:42:44,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:42:44,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:42:44,890 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:42:44,890 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:42:44,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:42:44,891 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:42:44,891 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:42:44,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:42:44,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:42:44,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:42:44,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:42:44,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:42:44,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:42:44,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:42:44,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 20:42:44,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 20:42:44,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:42:44,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:42:44,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:42:44,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:42:44,897 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/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 [2024-11-19 20:42:45,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:42:45,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:42:45,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:42:45,141 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:42:45,142 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:42:45,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2024-11-19 20:42:46,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:42:46,770 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:42:46,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2024-11-19 20:42:46,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19b5fad9/80bf8efd5daa42b491405a527a0519d2/FLAGa74626586 [2024-11-19 20:42:47,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19b5fad9/80bf8efd5daa42b491405a527a0519d2 [2024-11-19 20:42:47,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:42:47,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:42:47,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:42:47,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:42:47,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:42:47,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:42:47" (1/1) ... [2024-11-19 20:42:47,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1248e7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:47, skipping insertion in model container [2024-11-19 20:42:47,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:42:47" (1/1) ... [2024-11-19 20:42:47,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:42:47,509 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2024-11-19 20:42:47,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:42:47,566 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:42:47,600 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2024-11-19 20:42:47,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:42:47,641 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:42:47,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:47 WrapperNode [2024-11-19 20:42:47,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:42:47,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:42:47,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:42:47,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:42:47,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:47" (1/1) ... [2024-11-19 20:42:47,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:47" (1/1) ... [2024-11-19 20:42:47,696 INFO L138 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 231 [2024-11-19 20:42:47,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:42:47,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:42:47,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:42:47,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:42:47,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:47" (1/1) ... [2024-11-19 20:42:47,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:47" (1/1) ... [2024-11-19 20:42:47,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:47" (1/1) ... [2024-11-19 20:42:47,733 INFO L175 MemorySlicer]: Split 48 memory accesses to 3 slices as follows [2, 6, 40]. 83 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 13 writes are split as follows [0, 2, 11]. [2024-11-19 20:42:47,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:47" (1/1) ... [2024-11-19 20:42:47,733 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:47" (1/1) ... [2024-11-19 20:42:47,743 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:47" (1/1) ... [2024-11-19 20:42:47,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:47" (1/1) ... [2024-11-19 20:42:47,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:47" (1/1) ... [2024-11-19 20:42:47,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:47" (1/1) ... [2024-11-19 20:42:47,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:42:47,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:42:47,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:42:47,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:42:47,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:47" (1/1) ... [2024-11-19 20:42:47,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:42:47,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:42:47,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 20:42:47,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 20:42:47,822 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-19 20:42:47,822 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-19 20:42:47,822 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2024-11-19 20:42:47,823 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2024-11-19 20:42:47,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 20:42:47,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:42:47,823 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2024-11-19 20:42:47,823 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2024-11-19 20:42:47,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 20:42:47,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 20:42:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 20:42:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 20:42:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-11-19 20:42:47,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-11-19 20:42:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 20:42:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 20:42:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 20:42:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:42:47,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 20:42:47,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 20:42:47,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 20:42:47,825 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2024-11-19 20:42:47,825 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2024-11-19 20:42:47,825 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2024-11-19 20:42:47,825 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2024-11-19 20:42:47,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 20:42:47,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 20:42:47,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 20:42:47,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:42:47,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:42:47,945 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:42:47,949 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:42:48,289 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2024-11-19 20:42:48,289 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:42:48,300 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:42:48,301 INFO L316 CfgBuilder]: Removed 38 assume(true) statements. [2024-11-19 20:42:48,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:42:48 BoogieIcfgContainer [2024-11-19 20:42:48,301 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:42:48,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:42:48,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:42:48,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:42:48,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:42:47" (1/3) ... [2024-11-19 20:42:48,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6411a552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:42:48, skipping insertion in model container [2024-11-19 20:42:48,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:47" (2/3) ... [2024-11-19 20:42:48,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6411a552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:42:48, skipping insertion in model container [2024-11-19 20:42:48,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:42:48" (3/3) ... [2024-11-19 20:42:48,308 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2024-11-19 20:42:48,321 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:42:48,321 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 20:42:48,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:42:48,378 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;@70891cd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:42:48,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 20:42:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 97 states have (on average 1.7010309278350515) internal successors, (165), 117 states have internal predecessors, (165), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 20:42:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 20:42:48,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:48,389 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:48,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:48,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2003566147, now seen corresponding path program 1 times [2024-11-19 20:42:48,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:48,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122405822] [2024-11-19 20:42:48,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:48,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:48,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:42:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:48,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 20:42:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:48,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:42:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 20:42:48,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:48,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122405822] [2024-11-19 20:42:48,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122405822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:42:48,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:42:48,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:42:48,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623324445] [2024-11-19 20:42:48,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:42:48,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:42:48,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:48,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:42:48,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:42:48,832 INFO L87 Difference]: Start difference. First operand has 129 states, 97 states have (on average 1.7010309278350515) internal successors, (165), 117 states have internal predecessors, (165), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 20:42:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:49,075 INFO L93 Difference]: Finished difference Result 253 states and 431 transitions. [2024-11-19 20:42:49,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:42:49,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-19 20:42:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:49,089 INFO L225 Difference]: With dead ends: 253 [2024-11-19 20:42:49,089 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 20:42:49,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:42:49,098 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 38 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:49,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 183 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 20:42:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 20:42:49,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-19 20:42:49,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 109 states have internal predecessors, (116), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-19 20:42:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 150 transitions. [2024-11-19 20:42:49,150 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 150 transitions. Word has length 37 [2024-11-19 20:42:49,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:49,150 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 150 transitions. [2024-11-19 20:42:49,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 20:42:49,151 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 150 transitions. [2024-11-19 20:42:49,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 20:42:49,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:49,152 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:49,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 20:42:49,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:49,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:49,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1625779, now seen corresponding path program 1 times [2024-11-19 20:42:49,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:49,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293796499] [2024-11-19 20:42:49,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:49,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:49,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:42:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:49,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 20:42:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:49,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:42:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:42:50,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:50,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293796499] [2024-11-19 20:42:50,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293796499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:50,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749779208] [2024-11-19 20:42:50,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:50,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:50,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:42:50,134 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:42:50,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 20:42:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:50,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 20:42:50,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:42:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 20:42:50,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:42:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 20:42:50,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749779208] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:42:50,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:42:50,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 18 [2024-11-19 20:42:50,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272814319] [2024-11-19 20:42:50,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:42:50,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 20:42:50,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:50,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 20:42:50,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-11-19 20:42:50,653 INFO L87 Difference]: Start difference. First operand 121 states and 150 transitions. Second operand has 18 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-19 20:42:51,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:51,682 INFO L93 Difference]: Finished difference Result 263 states and 342 transitions. [2024-11-19 20:42:51,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 20:42:51,683 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 38 [2024-11-19 20:42:51,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:51,685 INFO L225 Difference]: With dead ends: 263 [2024-11-19 20:42:51,685 INFO L226 Difference]: Without dead ends: 145 [2024-11-19 20:42:51,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=1165, Unknown=0, NotChecked=0, Total=1332 [2024-11-19 20:42:51,687 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 66 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:51,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1197 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 20:42:51,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-19 20:42:51,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2024-11-19 20:42:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 108 states have (on average 1.2407407407407407) internal successors, (134), 126 states have internal predecessors, (134), 27 states have call successors, (27), 9 states have call predecessors, (27), 8 states have return successors, (14), 11 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 20:42:51,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 175 transitions. [2024-11-19 20:42:51,701 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 175 transitions. Word has length 38 [2024-11-19 20:42:51,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:51,702 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 175 transitions. [2024-11-19 20:42:51,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-19 20:42:51,702 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2024-11-19 20:42:51,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 20:42:51,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:51,704 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:51,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 20:42:51,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:51,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:51,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:51,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1447704685, now seen corresponding path program 1 times [2024-11-19 20:42:51,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:51,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502379406] [2024-11-19 20:42:51,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:51,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:52,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:42:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:52,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 20:42:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:52,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:42:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:53,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 20:42:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:53,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 20:42:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:53,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 20:42:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:53,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:42:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:53,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 20:42:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:53,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:42:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:53,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 20:42:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:53,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 20:42:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:53,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 20:42:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:53,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:42:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-19 20:42:53,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:53,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502379406] [2024-11-19 20:42:53,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502379406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:53,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147000340] [2024-11-19 20:42:53,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:53,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:53,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:42:53,731 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:42:53,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 20:42:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:53,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-19 20:42:54,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:42:54,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 20:42:54,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2024-11-19 20:42:54,461 WARN L873 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_~#dll~0.base| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |dll_create_generic_~#dll~0.base|))) (and (not (= (select .cse0 0) 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |dll_create_generic_~#dll~0.base| .cse0))))) is different from true [2024-11-19 20:42:54,541 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_2 (Array Int Int)) (|v_dll_insert_master_~dll#1.offset_5| Int) (|dll_create_generic_~#dll~0.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_dll_insert_master_#in~dll#1.base|) |v_dll_insert_master_~dll#1.offset_5|))) (and (not (= (select v_DerPreprocessor_2 0) 0)) (= |c_#memory_$Pointer$#1.base| (let ((.cse0 (store |c_old(#memory_$Pointer$#1.base)| |dll_create_generic_~#dll~0.base| v_DerPreprocessor_2))) (store .cse0 |c_dll_insert_master_#in~dll#1.base| (store (select .cse0 |c_dll_insert_master_#in~dll#1.base|) |v_dll_insert_master_~dll#1.offset_5| .cse1)))) (not (= .cse1 0))))) is different from true [2024-11-19 20:42:54,560 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_2 (Array Int Int)) (|v_dll_insert_master_~dll#1.offset_5| Int) (|dll_create_generic_~#dll~0.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |v_dll_insert_master_~dll#1.offset_5|))) (and (not (= (select v_DerPreprocessor_2 0) 0)) (not (= .cse0 0)) (= (let ((.cse1 (store |c_old(#memory_$Pointer$#1.base)| |dll_create_generic_~#dll~0.base| v_DerPreprocessor_2))) (store .cse1 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| (store (select .cse1 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |v_dll_insert_master_~dll#1.offset_5| .cse0))) |c_#memory_$Pointer$#1.base|)))) is different from true [2024-11-19 20:42:54,600 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2024-11-19 20:42:54,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 78 [2024-11-19 20:42:54,616 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-19 20:42:54,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 20:42:54,642 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:42:54,650 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-19 20:42:54,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 20:42:54,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-11-19 20:42:54,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:42:54,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2024-11-19 20:42:54,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 20:42:54,860 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 89 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 13 not checked. [2024-11-19 20:42:54,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:42:55,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:42:55,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 20:43:15,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147000340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:43:15,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:43:15,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 34] total 42 [2024-11-19 20:43:15,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622553560] [2024-11-19 20:43:15,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:43:15,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-19 20:43:15,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:43:15,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-19 20:43:15,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1406, Unknown=36, NotChecked=234, Total=1806 [2024-11-19 20:43:15,592 INFO L87 Difference]: Start difference. First operand 144 states and 175 transitions. Second operand has 42 states, 36 states have (on average 2.638888888888889) internal successors, (95), 34 states have internal predecessors, (95), 16 states have call successors, (25), 5 states have call predecessors, (25), 12 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2024-11-19 20:43:23,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:27,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:36,340 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_dll_create_generic_#res.base| 0)) (exists ((|dll_create_generic_~#dll~0.base| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |dll_create_generic_~#dll~0.base|))) (and (not (= (select .cse0 0) 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |dll_create_generic_~#dll~0.base| .cse0)))))) is different from true [2024-11-19 20:43:36,424 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_dll_insert_master_#in~dll#1.base|))) (and (exists ((v_DerPreprocessor_2 (Array Int Int)) (|v_dll_insert_master_~dll#1.offset_5| Int) (|dll_create_generic_~#dll~0.base| Int)) (let ((.cse1 (select .cse2 |v_dll_insert_master_~dll#1.offset_5|))) (and (not (= (select v_DerPreprocessor_2 0) 0)) (= |c_#memory_$Pointer$#1.base| (let ((.cse0 (store |c_old(#memory_$Pointer$#1.base)| |dll_create_generic_~#dll~0.base| v_DerPreprocessor_2))) (store .cse0 |c_dll_insert_master_#in~dll#1.base| (store (select .cse0 |c_dll_insert_master_#in~dll#1.base|) |v_dll_insert_master_~dll#1.offset_5| .cse1)))) (not (= .cse1 0))))) (not (= (select .cse2 |c_dll_insert_master_#in~dll#1.offset|) 0)))) is different from true [2024-11-19 20:43:36,479 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|))) (and (exists ((v_DerPreprocessor_2 (Array Int Int)) (|v_dll_insert_master_~dll#1.offset_5| Int) (|dll_create_generic_~#dll~0.base| Int)) (let ((.cse0 (select .cse2 |v_dll_insert_master_~dll#1.offset_5|))) (and (not (= (select v_DerPreprocessor_2 0) 0)) (not (= .cse0 0)) (= (let ((.cse1 (store |c_old(#memory_$Pointer$#1.base)| |dll_create_generic_~#dll~0.base| v_DerPreprocessor_2))) (store .cse1 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| (store (select .cse1 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |v_dll_insert_master_~dll#1.offset_5| .cse0))) |c_#memory_$Pointer$#1.base|)))) (not (= (select .cse2 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) 0)))) is different from true [2024-11-19 20:43:44,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:48,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:43:53,537 INFO L93 Difference]: Finished difference Result 373 states and 463 transitions. [2024-11-19 20:43:53,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-19 20:43:53,538 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 36 states have (on average 2.638888888888889) internal successors, (95), 34 states have internal predecessors, (95), 16 states have call successors, (25), 5 states have call predecessors, (25), 12 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) Word has length 110 [2024-11-19 20:43:53,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:43:53,541 INFO L225 Difference]: With dead ends: 373 [2024-11-19 20:43:53,541 INFO L226 Difference]: Without dead ends: 230 [2024-11-19 20:43:53,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 41.3s TimeCoverageRelationStatistics Valid=314, Invalid=3562, Unknown=54, NotChecked=762, Total=4692 [2024-11-19 20:43:53,544 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 169 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 48 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 2233 SdHoareTripleChecker+Invalid, 3952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 1392 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2024-11-19 20:43:53,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 2233 Invalid, 3952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 2508 Invalid, 4 Unknown, 1392 Unchecked, 17.3s Time] [2024-11-19 20:43:53,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-19 20:43:53,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 191. [2024-11-19 20:43:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 147 states have (on average 1.2244897959183674) internal successors, (180), 165 states have internal predecessors, (180), 31 states have call successors, (31), 12 states have call predecessors, (31), 12 states have return successors, (22), 16 states have call predecessors, (22), 17 states have call successors, (22) [2024-11-19 20:43:53,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 233 transitions. [2024-11-19 20:43:53,569 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 233 transitions. Word has length 110 [2024-11-19 20:43:53,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:43:53,570 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 233 transitions. [2024-11-19 20:43:53,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 36 states have (on average 2.638888888888889) internal successors, (95), 34 states have internal predecessors, (95), 16 states have call successors, (25), 5 states have call predecessors, (25), 12 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2024-11-19 20:43:53,570 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 233 transitions. [2024-11-19 20:43:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 20:43:53,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:43:53,573 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:43:53,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 20:43:53,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-19 20:43:53,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:43:53,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:43:53,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1319030911, now seen corresponding path program 1 times [2024-11-19 20:43:53,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:43:53,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067159597] [2024-11-19 20:43:53,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:43:53,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:43:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:54,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:43:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:54,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 20:43:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:54,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:43:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:55,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 20:43:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:55,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 20:43:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:55,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 20:43:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:55,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:43:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:55,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 20:43:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:55,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:43:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:55,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 20:43:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:55,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-19 20:43:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:55,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 20:43:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:55,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:43:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-19 20:43:55,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:43:55,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067159597] [2024-11-19 20:43:55,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067159597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:43:55,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174135945] [2024-11-19 20:43:55,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:43:55,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:43:55,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:43:55,329 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:43:55,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 20:43:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:55,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-19 20:43:55,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:43:55,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 20:44:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 91 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 20:44:17,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:44:24,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174135945] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:44:24,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:44:24,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 26 [2024-11-19 20:44:24,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188397999] [2024-11-19 20:44:24,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:44:24,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 20:44:24,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:44:24,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 20:44:24,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=601, Unknown=5, NotChecked=0, Total=702 [2024-11-19 20:44:24,220 INFO L87 Difference]: Start difference. First operand 191 states and 233 transitions. Second operand has 26 states, 20 states have (on average 4.95) internal successors, (99), 21 states have internal predecessors, (99), 12 states have call successors, (24), 5 states have call predecessors, (24), 8 states have return successors, (21), 8 states have call predecessors, (21), 12 states have call successors, (21)