./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.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 69d24e9affd7540aafb8052ecd737d7732ca2a63c7e8e16adc4217413d1d99a5 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:24:12,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:24:12,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 06:24:12,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:24:12,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:24:12,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:24:12,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:24:12,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:24:12,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 06:24:12,597 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 06:24:12,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:24:12,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:24:12,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:24:12,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:24:12,599 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:24:12,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:24:12,600 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:24:12,600 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:24:12,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:24:12,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:24:12,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:24:12,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:24:12,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:24:12,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:24:12,606 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:24:12,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:24:12,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:24:12,607 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:24:12,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:24:12,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:24:12,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:24:12,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:24:12,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:24:12,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:24:12,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:24:12,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:24:12,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:24:12,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:24:12,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:24:12,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:24:12,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:24:12,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:24:12,617 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 -> 69d24e9affd7540aafb8052ecd737d7732ca2a63c7e8e16adc4217413d1d99a5 [2024-11-09 06:24:12,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:24:12,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:24:12,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:24:12,951 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:24:12,952 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:24:12,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i [2024-11-09 06:24:14,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:24:14,803 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:24:14,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i [2024-11-09 06:24:14,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/165dbddb5/a90cba70699a4edbb192f3ed64e1868f/FLAG4e69d9f9c [2024-11-09 06:24:15,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/165dbddb5/a90cba70699a4edbb192f3ed64e1868f [2024-11-09 06:24:15,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:24:15,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:24:15,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:24:15,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:24:15,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:24:15,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:24:15" (1/1) ... [2024-11-09 06:24:15,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cff4000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:15, skipping insertion in model container [2024-11-09 06:24:15,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:24:15" (1/1) ... [2024-11-09 06:24:15,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:24:15,598 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/uthash-2.0.2/uthash_SFH_test2-1.i[37019,37032] [2024-11-09 06:24:15,763 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/uthash-2.0.2/uthash_SFH_test2-1.i[47352,47365] [2024-11-09 06:24:15,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:24:15,797 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:24:15,836 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/uthash-2.0.2/uthash_SFH_test2-1.i[37019,37032] [2024-11-09 06:24:15,889 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/uthash-2.0.2/uthash_SFH_test2-1.i[47352,47365] [2024-11-09 06:24:15,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:24:15,941 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:24:15,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:15 WrapperNode [2024-11-09 06:24:15,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:24:15,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:24:15,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:24:15,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:24:15,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:15" (1/1) ... [2024-11-09 06:24:15,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:15" (1/1) ... [2024-11-09 06:24:16,054 INFO L138 Inliner]: procedures = 208, calls = 227, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1302 [2024-11-09 06:24:16,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:24:16,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:24:16,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:24:16,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:24:16,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:15" (1/1) ... [2024-11-09 06:24:16,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:15" (1/1) ... [2024-11-09 06:24:16,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:15" (1/1) ... [2024-11-09 06:24:16,138 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-11-09 06:24:16,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:15" (1/1) ... [2024-11-09 06:24:16,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:15" (1/1) ... [2024-11-09 06:24:16,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:15" (1/1) ... [2024-11-09 06:24:16,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:15" (1/1) ... [2024-11-09 06:24:16,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:15" (1/1) ... [2024-11-09 06:24:16,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:15" (1/1) ... [2024-11-09 06:24:16,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:24:16,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:24:16,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:24:16,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:24:16,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:15" (1/1) ... [2024-11-09 06:24:16,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:24:16,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:24:16,278 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-09 06:24:16,281 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-09 06:24:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 06:24:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 06:24:16,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 06:24:16,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 06:24:16,331 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 06:24:16,331 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 06:24:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:24:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 06:24:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 06:24:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 06:24:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:24:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 06:24:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 06:24:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 06:24:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 06:24:16,333 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 06:24:16,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 06:24:16,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 06:24:16,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 06:24:16,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:24:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:24:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 06:24:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 06:24:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 06:24:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 06:24:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 06:24:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 06:24:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:24:16,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:24:16,584 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:24:16,586 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:24:18,094 INFO L? ?]: Removed 302 outVars from TransFormulas that were not future-live. [2024-11-09 06:24:18,094 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:24:18,123 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:24:18,126 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-09 06:24:18,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:24:18 BoogieIcfgContainer [2024-11-09 06:24:18,127 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:24:18,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:24:18,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:24:18,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:24:18,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:24:15" (1/3) ... [2024-11-09 06:24:18,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3721b78b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:24:18, skipping insertion in model container [2024-11-09 06:24:18,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:15" (2/3) ... [2024-11-09 06:24:18,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3721b78b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:24:18, skipping insertion in model container [2024-11-09 06:24:18,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:24:18" (3/3) ... [2024-11-09 06:24:18,136 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test2-1.i [2024-11-09 06:24:18,153 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:24:18,153 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 06:24:18,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:24:18,257 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;@2e2a884b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:24:18,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 06:24:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 381 states, 368 states have (on average 1.622282608695652) internal successors, (597), 375 states have internal predecessors, (597), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:24:18,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 06:24:18,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:18,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:24:18,271 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:18,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:18,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1749664919, now seen corresponding path program 1 times [2024-11-09 06:24:18,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:18,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115246679] [2024-11-09 06:24:18,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:18,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:24:18,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:18,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115246679] [2024-11-09 06:24:18,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115246679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:24:18,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:24:18,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:24:18,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912497738] [2024-11-09 06:24:18,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:24:18,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 06:24:18,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:18,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 06:24:18,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:24:18,515 INFO L87 Difference]: Start difference. First operand has 381 states, 368 states have (on average 1.622282608695652) internal successors, (597), 375 states have internal predecessors, (597), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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-11-09 06:24:18,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:18,597 INFO L93 Difference]: Finished difference Result 760 states and 1229 transitions. [2024-11-09 06:24:18,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 06:24:18,600 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 06:24:18,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:18,613 INFO L225 Difference]: With dead ends: 760 [2024-11-09 06:24:18,613 INFO L226 Difference]: Without dead ends: 377 [2024-11-09 06:24:18,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:24:18,622 INFO L432 NwaCegarLoop]: 553 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:24:18,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:24:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-09 06:24:18,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2024-11-09 06:24:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 365 states have (on average 1.4602739726027398) internal successors, (533), 371 states have internal predecessors, (533), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:24:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 549 transitions. [2024-11-09 06:24:18,689 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 549 transitions. Word has length 9 [2024-11-09 06:24:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:18,690 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 549 transitions. [2024-11-09 06:24:18,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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-11-09 06:24:18,691 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 549 transitions. [2024-11-09 06:24:18,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 06:24:18,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:18,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 06:24:18,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:24:18,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:18,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:18,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2144728515, now seen corresponding path program 1 times [2024-11-09 06:24:18,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:18,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748764015] [2024-11-09 06:24:18,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:18,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:24:19,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:19,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748764015] [2024-11-09 06:24:19,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748764015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:24:19,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:24:19,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:24:19,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84687136] [2024-11-09 06:24:19,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:24:19,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:24:19,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:19,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:24:19,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:24:19,196 INFO L87 Difference]: Start difference. First operand 377 states and 549 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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-11-09 06:24:19,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:19,388 INFO L93 Difference]: Finished difference Result 917 states and 1346 transitions. [2024-11-09 06:24:19,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:24:19,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-09 06:24:19,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:19,394 INFO L225 Difference]: With dead ends: 917 [2024-11-09 06:24:19,395 INFO L226 Difference]: Without dead ends: 741 [2024-11-09 06:24:19,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:24:19,398 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 518 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:24:19,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1669 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:24:19,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-09 06:24:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 379. [2024-11-09 06:24:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 367 states have (on average 1.457765667574932) internal successors, (535), 373 states have internal predecessors, (535), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:24:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 551 transitions. [2024-11-09 06:24:19,447 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 551 transitions. Word has length 64 [2024-11-09 06:24:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:19,448 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 551 transitions. [2024-11-09 06:24:19,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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-11-09 06:24:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 551 transitions. [2024-11-09 06:24:19,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 06:24:19,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:19,457 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 06:24:19,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:24:19,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:19,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:19,459 INFO L85 PathProgramCache]: Analyzing trace with hash 799714340, now seen corresponding path program 1 times [2024-11-09 06:24:19,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:19,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72933264] [2024-11-09 06:24:19,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:19,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:19,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:24:19,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:19,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72933264] [2024-11-09 06:24:19,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72933264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:24:19,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:24:19,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:24:20,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368606759] [2024-11-09 06:24:20,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:24:20,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:24:20,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:20,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:24:20,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:24:20,002 INFO L87 Difference]: Start difference. First operand 379 states and 551 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 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-11-09 06:24:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:20,119 INFO L93 Difference]: Finished difference Result 712 states and 1032 transitions. [2024-11-09 06:24:20,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:24:20,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2024-11-09 06:24:20,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:20,123 INFO L225 Difference]: With dead ends: 712 [2024-11-09 06:24:20,123 INFO L226 Difference]: Without dead ends: 337 [2024-11-09 06:24:20,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:24:20,128 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 30 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:24:20,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1322 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:24:20,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-09 06:24:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2024-11-09 06:24:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 325 states have (on average 1.4092307692307693) internal successors, (458), 331 states have internal predecessors, (458), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:24:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 474 transitions. [2024-11-09 06:24:20,144 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 474 transitions. Word has length 140 [2024-11-09 06:24:20,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:20,144 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 474 transitions. [2024-11-09 06:24:20,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 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-11-09 06:24:20,145 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 474 transitions. [2024-11-09 06:24:20,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 06:24:20,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:20,149 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 06:24:20,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:24:20,149 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:20,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:20,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1221731408, now seen corresponding path program 1 times [2024-11-09 06:24:20,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:20,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059987639] [2024-11-09 06:24:20,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:20,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:20,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:24:20,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:20,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059987639] [2024-11-09 06:24:20,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059987639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:24:20,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:24:20,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:24:20,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139648657] [2024-11-09 06:24:20,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:24:20,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:24:20,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:20,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:24:20,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:24:20,384 INFO L87 Difference]: Start difference. First operand 337 states and 474 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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-11-09 06:24:20,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:20,462 INFO L93 Difference]: Finished difference Result 905 states and 1288 transitions. [2024-11-09 06:24:20,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:24:20,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2024-11-09 06:24:20,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:20,472 INFO L225 Difference]: With dead ends: 905 [2024-11-09 06:24:20,472 INFO L226 Difference]: Without dead ends: 572 [2024-11-09 06:24:20,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:24:20,478 INFO L432 NwaCegarLoop]: 662 mSDtfsCounter, 271 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:24:20,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1114 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:24:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-09 06:24:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 570. [2024-11-09 06:24:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 553 states have (on average 1.426763110307414) internal successors, (789), 564 states have internal predecessors, (789), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 06:24:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 815 transitions. [2024-11-09 06:24:20,508 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 815 transitions. Word has length 140 [2024-11-09 06:24:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:20,509 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 815 transitions. [2024-11-09 06:24:20,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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-11-09 06:24:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 815 transitions. [2024-11-09 06:24:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 06:24:20,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:20,515 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:24:20,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:24:20,516 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:20,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:20,516 INFO L85 PathProgramCache]: Analyzing trace with hash -747219640, now seen corresponding path program 1 times [2024-11-09 06:24:20,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:20,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585859262] [2024-11-09 06:24:20,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:20,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:20,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:24:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:20,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:24:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:24:20,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:20,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585859262] [2024-11-09 06:24:20,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585859262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:24:20,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:24:20,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:24:20,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135181319] [2024-11-09 06:24:20,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:24:20,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:24:20,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:20,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:24:20,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:24:20,917 INFO L87 Difference]: Start difference. First operand 570 states and 815 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:24:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:21,272 INFO L93 Difference]: Finished difference Result 810 states and 1171 transitions. [2024-11-09 06:24:21,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:24:21,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-09 06:24:21,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:21,278 INFO L225 Difference]: With dead ends: 810 [2024-11-09 06:24:21,278 INFO L226 Difference]: Without dead ends: 489 [2024-11-09 06:24:21,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:24:21,280 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 38 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:24:21,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1339 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:24:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-09 06:24:21,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 486. [2024-11-09 06:24:21,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 469 states have (on average 1.3539445628997868) internal successors, (635), 480 states have internal predecessors, (635), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 06:24:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 661 transitions. [2024-11-09 06:24:21,304 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 661 transitions. Word has length 155 [2024-11-09 06:24:21,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:21,306 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 661 transitions. [2024-11-09 06:24:21,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:24:21,306 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 661 transitions. [2024-11-09 06:24:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 06:24:21,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:21,309 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:24:21,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:24:21,310 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:21,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:21,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1918733764, now seen corresponding path program 1 times [2024-11-09 06:24:21,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:21,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098713683] [2024-11-09 06:24:21,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:21,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:21,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:24:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:21,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:24:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:24:21,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:21,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098713683] [2024-11-09 06:24:21,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098713683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:24:21,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:24:21,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:24:21,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289954910] [2024-11-09 06:24:21,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:24:21,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:24:21,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:21,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:24:21,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:24:21,683 INFO L87 Difference]: Start difference. First operand 486 states and 661 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:24:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:22,207 INFO L93 Difference]: Finished difference Result 963 states and 1313 transitions. [2024-11-09 06:24:22,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:24:22,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-09 06:24:22,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:22,212 INFO L225 Difference]: With dead ends: 963 [2024-11-09 06:24:22,213 INFO L226 Difference]: Without dead ends: 568 [2024-11-09 06:24:22,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:24:22,216 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 1190 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:24:22,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 1317 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:24:22,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-09 06:24:22,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 382. [2024-11-09 06:24:22,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 370 states have (on average 1.3432432432432433) internal successors, (497), 376 states have internal predecessors, (497), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:24:22,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 513 transitions. [2024-11-09 06:24:22,237 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 513 transitions. Word has length 155 [2024-11-09 06:24:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:22,239 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 513 transitions. [2024-11-09 06:24:22,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:24:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 513 transitions. [2024-11-09 06:24:22,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 06:24:22,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:22,244 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 06:24:22,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:24:22,244 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:22,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:22,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1937851632, now seen corresponding path program 1 times [2024-11-09 06:24:22,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:22,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672784320] [2024-11-09 06:24:22,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:22,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:23,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:24:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:23,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:24:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:24:23,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:23,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672784320] [2024-11-09 06:24:23,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672784320] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:24:23,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418752882] [2024-11-09 06:24:23,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:23,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:24:23,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:24:23,302 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-09 06:24:23,304 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-09 06:24:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:23,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 06:24:23,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:24:23,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:24:24,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 06:24:24,034 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 15 treesize of output 7 [2024-11-09 06:24:24,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:24:24,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:24:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:24:24,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418752882] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:24:24,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:24:24,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2024-11-09 06:24:24,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187190564] [2024-11-09 06:24:24,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:24:24,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:24:24,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:24,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:24:24,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:24:24,281 INFO L87 Difference]: Start difference. First operand 382 states and 513 transitions. Second operand has 12 states, 12 states have (on average 27.25) internal successors, (327), 11 states have internal predecessors, (327), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 06:24:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:24,885 INFO L93 Difference]: Finished difference Result 1271 states and 1722 transitions. [2024-11-09 06:24:24,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:24:24,886 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 27.25) internal successors, (327), 11 states have internal predecessors, (327), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 165 [2024-11-09 06:24:24,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:24,893 INFO L225 Difference]: With dead ends: 1271 [2024-11-09 06:24:24,893 INFO L226 Difference]: Without dead ends: 1137 [2024-11-09 06:24:24,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 327 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-11-09 06:24:24,895 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 1922 mSDsluCounter, 2532 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1940 SdHoareTripleChecker+Valid, 2932 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:24:24,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1940 Valid, 2932 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:24:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2024-11-09 06:24:24,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 729. [2024-11-09 06:24:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 713 states have (on average 1.338008415147265) internal successors, (954), 719 states have internal predecessors, (954), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 06:24:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 976 transitions. [2024-11-09 06:24:24,938 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 976 transitions. Word has length 165 [2024-11-09 06:24:24,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:24,938 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 976 transitions. [2024-11-09 06:24:24,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.25) internal successors, (327), 11 states have internal predecessors, (327), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 06:24:24,939 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2024-11-09 06:24:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-09 06:24:24,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:24,945 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:24:24,968 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-09 06:24:25,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:24:25,146 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:25,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:25,147 INFO L85 PathProgramCache]: Analyzing trace with hash -437163785, now seen corresponding path program 1 times [2024-11-09 06:24:25,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:25,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047641599] [2024-11-09 06:24:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:29,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:24:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:29,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:24:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:24:29,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:29,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047641599] [2024-11-09 06:24:29,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047641599] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:24:29,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528625122] [2024-11-09 06:24:29,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:29,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:24:29,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:24:29,421 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-09 06:24:29,423 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-09 06:24:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:30,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 06:24:30,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:24:30,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:24:30,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 06:24:30,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 06:24:30,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 06:24:30,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 06:24:30,787 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 15 treesize of output 7 [2024-11-09 06:24:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:24:30,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:24:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:24:31,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528625122] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:24:31,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:24:31,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2024-11-09 06:24:31,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667444279] [2024-11-09 06:24:31,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:24:31,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 06:24:31,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:31,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 06:24:31,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2024-11-09 06:24:31,366 INFO L87 Difference]: Start difference. First operand 729 states and 976 transitions. Second operand has 20 states, 20 states have (on average 39.35) internal successors, (787), 19 states have internal predecessors, (787), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 06:24:32,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:32,417 INFO L93 Difference]: Finished difference Result 2516 states and 3417 transitions. [2024-11-09 06:24:32,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 06:24:32,418 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 39.35) internal successors, (787), 19 states have internal predecessors, (787), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 393 [2024-11-09 06:24:32,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:32,430 INFO L225 Difference]: With dead ends: 2516 [2024-11-09 06:24:32,431 INFO L226 Difference]: Without dead ends: 2382 [2024-11-09 06:24:32,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 782 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2024-11-09 06:24:32,434 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 3563 mSDsluCounter, 5396 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3608 SdHoareTripleChecker+Valid, 5796 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:24:32,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3608 Valid, 5796 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:24:32,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2024-11-09 06:24:32,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 1593. [2024-11-09 06:24:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1571 states have (on average 1.336728198599618) internal successors, (2100), 1577 states have internal predecessors, (2100), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 06:24:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2134 transitions. [2024-11-09 06:24:32,516 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2134 transitions. Word has length 393 [2024-11-09 06:24:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:32,517 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2134 transitions. [2024-11-09 06:24:32,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 39.35) internal successors, (787), 19 states have internal predecessors, (787), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 06:24:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2134 transitions. [2024-11-09 06:24:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-11-09 06:24:32,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:32,538 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:24:32,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:24:32,742 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,SelfDestructingSolverStorable7 [2024-11-09 06:24:32,743 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:32,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:32,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2008568453, now seen corresponding path program 2 times [2024-11-09 06:24:32,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:32,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080588610] [2024-11-09 06:24:32,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:32,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms