./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-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_FNV_test5-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 c7b5cea41c34641368705a00e3051c009f6877551b3530b7d4fceaf386f5f58c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:11:32,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:11:32,233 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 06:11:32,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:11:32,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:11:32,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:11:32,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:11:32,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:11:32,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 06:11:32,277 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 06:11:32,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:11:32,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:11:32,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:11:32,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:11:32,279 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:11:32,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:11:32,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:11:32,284 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:11:32,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:11:32,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:11:32,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:11:32,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:11:32,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:11:32,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:11:32,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:11:32,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:11:32,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:11:32,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:11:32,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:11:32,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:11:32,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:11:32,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:11:32,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:11:32,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:11:32,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:11:32,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:11:32,291 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:11:32,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:11:32,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:11:32,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:11:32,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:11:32,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:11:32,292 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 -> c7b5cea41c34641368705a00e3051c009f6877551b3530b7d4fceaf386f5f58c [2024-11-09 06:11:32,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:11:32,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:11:32,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:11:32,608 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:11:32,609 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:11:32,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i [2024-11-09 06:11:34,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:11:34,847 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:11:34,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i [2024-11-09 06:11:34,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0fd0aff7/c22bab04df2a4f888811aec9e3e59479/FLAG77e4c7ebb [2024-11-09 06:11:35,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0fd0aff7/c22bab04df2a4f888811aec9e3e59479 [2024-11-09 06:11:35,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:11:35,091 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:11:35,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:11:35,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:11:35,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:11:35,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:11:35" (1/1) ... [2024-11-09 06:11:35,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9bef84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:35, skipping insertion in model container [2024-11-09 06:11:35,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:11:35" (1/1) ... [2024-11-09 06:11:35,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:11:35,654 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_FNV_test5-1.i[33021,33034] [2024-11-09 06:11:35,835 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_FNV_test5-1.i[49681,49694] [2024-11-09 06:11:35,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:11:35,868 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:11:35,930 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_FNV_test5-1.i[33021,33034] [2024-11-09 06:11:36,033 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_FNV_test5-1.i[49681,49694] [2024-11-09 06:11:36,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:11:36,081 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:11:36,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:36 WrapperNode [2024-11-09 06:11:36,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:11:36,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:11:36,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:11:36,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:11:36,091 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:11:36" (1/1) ... [2024-11-09 06:11:36,138 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:11:36" (1/1) ... [2024-11-09 06:11:36,220 INFO L138 Inliner]: procedures = 177, calls = 373, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2036 [2024-11-09 06:11:36,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:11:36,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:11:36,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:11:36,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:11:36,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:36" (1/1) ... [2024-11-09 06:11:36,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:36" (1/1) ... [2024-11-09 06:11:36,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:36" (1/1) ... [2024-11-09 06:11:36,393 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2024-11-09 06:11:36,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:36" (1/1) ... [2024-11-09 06:11:36,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:36" (1/1) ... [2024-11-09 06:11:36,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:36" (1/1) ... [2024-11-09 06:11:36,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:36" (1/1) ... [2024-11-09 06:11:36,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:36" (1/1) ... [2024-11-09 06:11:36,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:36" (1/1) ... [2024-11-09 06:11:36,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:11:36,538 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:11:36,538 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:11:36,538 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:11:36,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:36" (1/1) ... [2024-11-09 06:11:36,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:11:36,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:11:36,584 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:11:36,596 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:11:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 06:11:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 06:11:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 06:11:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 06:11:36,647 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 06:11:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 06:11:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 06:11:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 06:11:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 06:11:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 06:11:36,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 06:11:36,651 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 06:11:36,651 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 06:11:36,651 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 06:11:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:11:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:11:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 06:11:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 06:11:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 06:11:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:11:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 06:11:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 06:11:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 06:11:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:11:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 06:11:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 06:11:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 06:11:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:11:36,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:11:36,885 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:11:36,888 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:11:39,095 INFO L? ?]: Removed 483 outVars from TransFormulas that were not future-live. [2024-11-09 06:11:39,096 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:11:39,119 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:11:39,120 INFO L316 CfgBuilder]: Removed 83 assume(true) statements. [2024-11-09 06:11:39,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:11:39 BoogieIcfgContainer [2024-11-09 06:11:39,121 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:11:39,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:11:39,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:11:39,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:11:39,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:11:35" (1/3) ... [2024-11-09 06:11:39,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea159bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:11:39, skipping insertion in model container [2024-11-09 06:11:39,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:36" (2/3) ... [2024-11-09 06:11:39,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea159bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:11:39, skipping insertion in model container [2024-11-09 06:11:39,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:11:39" (3/3) ... [2024-11-09 06:11:39,133 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-1.i [2024-11-09 06:11:39,150 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:11:39,150 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 06:11:39,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:11:39,320 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;@1b10a1ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:11:39,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 06:11:39,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 569 states, 553 states have (on average 1.623869801084991) internal successors, (898), 560 states have internal predecessors, (898), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 06:11:39,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 06:11:39,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:39,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:11:39,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:11:39,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:39,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1010421804, now seen corresponding path program 1 times [2024-11-09 06:11:39,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:11:39,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149332457] [2024-11-09 06:11:39,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:39,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:39,548 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:11:39,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:11:39,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149332457] [2024-11-09 06:11:39,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149332457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:11:39,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:11:39,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:11:39,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874434834] [2024-11-09 06:11:39,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:11:39,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 06:11:39,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:11:39,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 06:11:39,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:11:39,593 INFO L87 Difference]: Start difference. First operand has 569 states, 553 states have (on average 1.623869801084991) internal successors, (898), 560 states have internal predecessors, (898), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:11:39,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:39,695 INFO L93 Difference]: Finished difference Result 1136 states and 1843 transitions. [2024-11-09 06:11:39,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 06:11:39,701 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-11-09 06:11:39,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:39,728 INFO L225 Difference]: With dead ends: 1136 [2024-11-09 06:11:39,729 INFO L226 Difference]: Without dead ends: 565 [2024-11-09 06:11:39,737 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:11:39,742 INFO L432 NwaCegarLoop]: 828 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, 828 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:11:39,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:11:39,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-09 06:11:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2024-11-09 06:11:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 550 states have (on average 1.4581818181818182) internal successors, (802), 556 states have internal predecessors, (802), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 06:11:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 824 transitions. [2024-11-09 06:11:39,832 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 824 transitions. Word has length 8 [2024-11-09 06:11:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:39,832 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 824 transitions. [2024-11-09 06:11:39,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:11:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 824 transitions. [2024-11-09 06:11:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 06:11:39,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:39,842 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] [2024-11-09 06:11:39,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:11:39,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:11:39,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:39,843 INFO L85 PathProgramCache]: Analyzing trace with hash 76912623, now seen corresponding path program 1 times [2024-11-09 06:11:39,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:11:39,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258005426] [2024-11-09 06:11:39,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:39,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:40,236 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:11:40,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:11:40,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258005426] [2024-11-09 06:11:40,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258005426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:11:40,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:11:40,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:11:40,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500503668] [2024-11-09 06:11:40,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:11:40,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:11:40,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:11:40,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:11:40,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:11:40,243 INFO L87 Difference]: Start difference. First operand 565 states and 824 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:11:40,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:40,354 INFO L93 Difference]: Finished difference Result 1292 states and 1895 transitions. [2024-11-09 06:11:40,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:11:40,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2024-11-09 06:11:40,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:40,368 INFO L225 Difference]: With dead ends: 1292 [2024-11-09 06:11:40,368 INFO L226 Difference]: Without dead ends: 1117 [2024-11-09 06:11:40,370 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:11:40,371 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 787 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:40,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1641 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:11:40,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2024-11-09 06:11:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 566. [2024-11-09 06:11:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 551 states have (on average 1.4573502722323048) internal successors, (803), 557 states have internal predecessors, (803), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 06:11:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 825 transitions. [2024-11-09 06:11:40,420 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 825 transitions. Word has length 62 [2024-11-09 06:11:40,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:40,421 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 825 transitions. [2024-11-09 06:11:40,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:11:40,421 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 825 transitions. [2024-11-09 06:11:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-09 06:11:40,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:40,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:40,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:11:40,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:11:40,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:40,432 INFO L85 PathProgramCache]: Analyzing trace with hash 41978054, now seen corresponding path program 1 times [2024-11-09 06:11:40,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:11:40,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310614172] [2024-11-09 06:11:40,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:40,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:11:41,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:11:41,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310614172] [2024-11-09 06:11:41,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310614172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:11:41,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:11:41,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:11:41,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074915561] [2024-11-09 06:11:41,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:11:41,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:11:41,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:11:41,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:11:41,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:11:41,276 INFO L87 Difference]: Start difference. First operand 566 states and 825 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 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:11:41,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:41,390 INFO L93 Difference]: Finished difference Result 1132 states and 1650 transitions. [2024-11-09 06:11:41,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:11:41,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 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 208 [2024-11-09 06:11:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:41,396 INFO L225 Difference]: With dead ends: 1132 [2024-11-09 06:11:41,397 INFO L226 Difference]: Without dead ends: 569 [2024-11-09 06:11:41,398 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:11:41,399 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 105 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2295 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:41,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2295 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:11:41,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-09 06:11:41,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2024-11-09 06:11:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 551 states have (on average 1.4446460980036298) internal successors, (796), 557 states have internal predecessors, (796), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 06:11:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 818 transitions. [2024-11-09 06:11:41,422 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 818 transitions. Word has length 208 [2024-11-09 06:11:41,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:41,422 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 818 transitions. [2024-11-09 06:11:41,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 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:11:41,423 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 818 transitions. [2024-11-09 06:11:41,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-09 06:11:41,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:41,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:41,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:11:41,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:11:41,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:41,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1497571398, now seen corresponding path program 1 times [2024-11-09 06:11:41,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:11:41,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370003804] [2024-11-09 06:11:41,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:41,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:41,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:11:41,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:11:41,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370003804] [2024-11-09 06:11:41,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370003804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:11:41,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:11:41,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:11:41,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658741798] [2024-11-09 06:11:41,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:11:41,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:11:41,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:11:41,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:11:41,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:11:41,854 INFO L87 Difference]: Start difference. First operand 566 states and 818 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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:11:41,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:41,932 INFO L93 Difference]: Finished difference Result 1258 states and 1822 transitions. [2024-11-09 06:11:41,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:11:41,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 208 [2024-11-09 06:11:41,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:41,940 INFO L225 Difference]: With dead ends: 1258 [2024-11-09 06:11:41,941 INFO L226 Difference]: Without dead ends: 695 [2024-11-09 06:11:41,943 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:11:41,948 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 134 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:41,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1625 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:11:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-11-09 06:11:41,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2024-11-09 06:11:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 680 states have (on average 1.4470588235294117) internal successors, (984), 686 states have internal predecessors, (984), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 06:11:41,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1006 transitions. [2024-11-09 06:11:41,978 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1006 transitions. Word has length 208 [2024-11-09 06:11:41,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:41,981 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 1006 transitions. [2024-11-09 06:11:41,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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:11:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1006 transitions. [2024-11-09 06:11:41,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-09 06:11:41,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:41,988 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:41,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:11:41,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:11:41,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:41,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2142898577, now seen corresponding path program 1 times [2024-11-09 06:11:41,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:11:41,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421677347] [2024-11-09 06:11:41,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:41,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:42,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 06:11:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:42,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 06:11:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:11:42,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:11:42,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421677347] [2024-11-09 06:11:42,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421677347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:11:42,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:11:42,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:11:42,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635709831] [2024-11-09 06:11:42,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:11:42,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:11:42,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:11:42,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:11:42,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:11:42,624 INFO L87 Difference]: Start difference. First operand 695 states and 1006 transitions. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 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:11:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:43,374 INFO L93 Difference]: Finished difference Result 1219 states and 1764 transitions. [2024-11-09 06:11:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:11:43,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 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 223 [2024-11-09 06:11:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:43,378 INFO L225 Difference]: With dead ends: 1219 [2024-11-09 06:11:43,379 INFO L226 Difference]: Without dead ends: 656 [2024-11-09 06:11:43,380 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:11:43,381 INFO L432 NwaCegarLoop]: 709 mSDtfsCounter, 38 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2699 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:43,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 2699 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:11:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-11-09 06:11:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 653. [2024-11-09 06:11:43,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 638 states have (on average 1.421630094043887) internal successors, (907), 644 states have internal predecessors, (907), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 06:11:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 929 transitions. [2024-11-09 06:11:43,406 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 929 transitions. Word has length 223 [2024-11-09 06:11:43,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:43,407 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 929 transitions. [2024-11-09 06:11:43,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 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:11:43,407 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 929 transitions. [2024-11-09 06:11:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-09 06:11:43,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:43,410 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:43,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:11:43,411 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:11:43,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:43,412 INFO L85 PathProgramCache]: Analyzing trace with hash -652497891, now seen corresponding path program 1 times [2024-11-09 06:11:43,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:11:43,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022242659] [2024-11-09 06:11:43,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:43,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:43,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 06:11:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:43,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 06:11:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:43,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:11:43,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:11:43,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022242659] [2024-11-09 06:11:43,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022242659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:11:43,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:11:43,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:11:43,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895382850] [2024-11-09 06:11:43,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:11:43,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:11:43,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:11:43,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:11:43,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:11:43,809 INFO L87 Difference]: Start difference. First operand 653 states and 929 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 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:11:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:44,231 INFO L93 Difference]: Finished difference Result 1470 states and 2101 transitions. [2024-11-09 06:11:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:11:44,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 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 223 [2024-11-09 06:11:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:44,241 INFO L225 Difference]: With dead ends: 1470 [2024-11-09 06:11:44,241 INFO L226 Difference]: Without dead ends: 949 [2024-11-09 06:11:44,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:11:44,243 INFO L432 NwaCegarLoop]: 921 mSDtfsCounter, 463 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 2443 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:44,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 2443 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:11:44,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-11-09 06:11:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 944. [2024-11-09 06:11:44,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 921 states have (on average 1.4223669923995657) internal successors, (1310), 932 states have internal predecessors, (1310), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 06:11:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1348 transitions. [2024-11-09 06:11:44,281 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1348 transitions. Word has length 223 [2024-11-09 06:11:44,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:44,283 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1348 transitions. [2024-11-09 06:11:44,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 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:11:44,283 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1348 transitions. [2024-11-09 06:11:44,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 06:11:44,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:44,286 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:44,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:11:44,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:11:44,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:44,287 INFO L85 PathProgramCache]: Analyzing trace with hash -374873184, now seen corresponding path program 1 times [2024-11-09 06:11:44,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:11:44,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870569745] [2024-11-09 06:11:44,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:44,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:44,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 06:11:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:44,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 06:11:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:44,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 06:11:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:44,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-09 06:11:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:11:44,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:11:44,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870569745] [2024-11-09 06:11:44,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870569745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:11:44,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013257210] [2024-11-09 06:11:44,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:44,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:44,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:11:44,913 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:11:44,915 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:11:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:45,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 1194 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:11:45,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 06:11:45,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:11:45,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013257210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:11:45,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:11:45,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 06:11:45,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177033517] [2024-11-09 06:11:45,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:11:45,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:11:45,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:11:45,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:11:45,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:11:45,496 INFO L87 Difference]: Start difference. First operand 944 states and 1348 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:11:45,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:45,580 INFO L93 Difference]: Finished difference Result 1303 states and 1888 transitions. [2024-11-09 06:11:45,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:11:45,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 238 [2024-11-09 06:11:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:45,587 INFO L225 Difference]: With dead ends: 1303 [2024-11-09 06:11:45,588 INFO L226 Difference]: Without dead ends: 984 [2024-11-09 06:11:45,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:11:45,590 INFO L432 NwaCegarLoop]: 714 mSDtfsCounter, 8 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:45,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1413 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:11:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-11-09 06:11:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2024-11-09 06:11:45,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 961 states have (on average 1.4047866805411031) internal successors, (1350), 972 states have internal predecessors, (1350), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 06:11:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1388 transitions. [2024-11-09 06:11:45,624 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1388 transitions. Word has length 238 [2024-11-09 06:11:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:45,624 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1388 transitions. [2024-11-09 06:11:45,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:11:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1388 transitions. [2024-11-09 06:11:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 06:11:45,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:45,628 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:45,654 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:11:45,829 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:11:45,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:11:45,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:45,832 INFO L85 PathProgramCache]: Analyzing trace with hash 996934114, now seen corresponding path program 1 times [2024-11-09 06:11:45,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:11:45,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053270601] [2024-11-09 06:11:45,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:45,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:46,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 06:11:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:46,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 06:11:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:46,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 06:11:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:46,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-09 06:11:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:11:46,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:11:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053270601] [2024-11-09 06:11:46,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053270601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:11:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151004093] [2024-11-09 06:11:46,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:46,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:46,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:11:46,311 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:11:46,323 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:11:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:46,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:11:46,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 06:11:46,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:11:46,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151004093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:11:46,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:11:46,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-09 06:11:46,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382860917] [2024-11-09 06:11:46,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:11:46,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:11:46,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:11:46,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:11:46,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:11:46,945 INFO L87 Difference]: Start difference. First operand 984 states and 1388 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:11:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:47,040 INFO L93 Difference]: Finished difference Result 1315 states and 1880 transitions. [2024-11-09 06:11:47,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:11:47,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 238 [2024-11-09 06:11:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:47,046 INFO L225 Difference]: With dead ends: 1315 [2024-11-09 06:11:47,046 INFO L226 Difference]: Without dead ends: 956 [2024-11-09 06:11:47,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:11:47,048 INFO L432 NwaCegarLoop]: 706 mSDtfsCounter, 105 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2025 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:47,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2025 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:11:47,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-11-09 06:11:47,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 956. [2024-11-09 06:11:47,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 933 states have (on average 1.4019292604501608) internal successors, (1308), 944 states have internal predecessors, (1308), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 06:11:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1346 transitions. [2024-11-09 06:11:47,085 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1346 transitions. Word has length 238 [2024-11-09 06:11:47,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:47,086 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1346 transitions. [2024-11-09 06:11:47,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:11:47,087 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1346 transitions. [2024-11-09 06:11:47,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 06:11:47,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:47,090 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:47,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:11:47,291 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:11:47,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:11:47,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:47,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1546387308, now seen corresponding path program 1 times [2024-11-09 06:11:47,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:11:47,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603576176] [2024-11-09 06:11:47,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:47,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:47,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 06:11:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:47,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 06:11:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:47,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 06:11:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:47,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-09 06:11:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:11:47,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:11:47,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603576176] [2024-11-09 06:11:47,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603576176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:11:47,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600726870] [2024-11-09 06:11:47,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:47,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:47,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:11:47,807 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:11:47,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:11:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:48,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:11:48,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:11:48,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:11:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:11:48,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600726870] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:11:48,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:11:48,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-09 06:11:48,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434507708] [2024-11-09 06:11:48,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:11:48,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:11:48,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:11:48,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:11:48,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:11:48,862 INFO L87 Difference]: Start difference. First operand 956 states and 1346 transitions. Second operand has 8 states, 8 states have (on average 67.125) internal successors, (537), 7 states have internal predecessors, (537), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 06:11:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:49,450 INFO L93 Difference]: Finished difference Result 2554 states and 3639 transitions. [2024-11-09 06:11:49,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:11:49,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 67.125) internal successors, (537), 7 states have internal predecessors, (537), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 238 [2024-11-09 06:11:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:49,462 INFO L225 Difference]: With dead ends: 2554 [2024-11-09 06:11:49,463 INFO L226 Difference]: Without dead ends: 2222 [2024-11-09 06:11:49,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:11:49,466 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 2216 mSDsluCounter, 3230 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2263 SdHoareTripleChecker+Valid, 3949 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:49,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2263 Valid, 3949 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:11:49,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2024-11-09 06:11:49,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 1703. [2024-11-09 06:11:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1665 states have (on average 1.3867867867867867) internal successors, (2309), 1676 states have internal predecessors, (2309), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 26 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 06:11:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2377 transitions. [2024-11-09 06:11:49,527 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2377 transitions. Word has length 238 [2024-11-09 06:11:49,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:49,528 INFO L471 AbstractCegarLoop]: Abstraction has 1703 states and 2377 transitions. [2024-11-09 06:11:49,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 67.125) internal successors, (537), 7 states have internal predecessors, (537), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 06:11:49,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2377 transitions. [2024-11-09 06:11:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2024-11-09 06:11:49,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:49,544 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:49,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 06:11:49,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:49,746 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:11:49,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:49,747 INFO L85 PathProgramCache]: Analyzing trace with hash -255161959, now seen corresponding path program 1 times [2024-11-09 06:11:49,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:11:49,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665428541] [2024-11-09 06:11:49,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:49,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:51,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 06:11:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:51,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 06:11:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:51,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 06:11:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:51,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-09 06:11:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 4 proven. 534 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2024-11-09 06:11:51,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:11:51,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665428541] [2024-11-09 06:11:51,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665428541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:11:51,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828319607] [2024-11-09 06:11:51,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:51,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:51,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:11:51,623 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:11:51,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:11:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:52,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 3219 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 06:11:52,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:11:53,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:11:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:11:54,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828319607] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:11:54,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:11:54,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-11-09 06:11:54,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855367644] [2024-11-09 06:11:54,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:11:54,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 06:11:54,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:11:54,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 06:11:54,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2024-11-09 06:11:54,307 INFO L87 Difference]: Start difference. First operand 1703 states and 2377 transitions. Second operand has 17 states, 17 states have (on average 98.17647058823529) internal successors, (1669), 16 states have internal predecessors, (1669), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-09 06:12:01,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 06:12:03,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 06:12:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:12:07,411 INFO L93 Difference]: Finished difference Result 16930 states and 24075 transitions. [2024-11-09 06:12:07,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-09 06:12:07,413 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 98.17647058823529) internal successors, (1669), 16 states have internal predecessors, (1669), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 676 [2024-11-09 06:12:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:12:07,482 INFO L225 Difference]: With dead ends: 16930 [2024-11-09 06:12:07,483 INFO L226 Difference]: Without dead ends: 15847 [2024-11-09 06:12:07,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1418 GetRequests, 1349 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1242, Invalid=3728, Unknown=0, NotChecked=0, Total=4970 [2024-11-09 06:12:07,495 INFO L432 NwaCegarLoop]: 1606 mSDtfsCounter, 40921 mSDsluCounter, 15219 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40921 SdHoareTripleChecker+Valid, 16825 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:12:07,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40921 Valid, 16825 Invalid, 3341 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [658 Valid, 2683 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2024-11-09 06:12:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15847 states. [2024-11-09 06:12:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15847 to 9399. [2024-11-09 06:12:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9399 states, 9269 states have (on average 1.3837522925881973) internal successors, (12826), 9285 states have internal predecessors, (12826), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 114 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-09 06:12:07,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9399 states to 9399 states and 13078 transitions. [2024-11-09 06:12:07,868 INFO L78 Accepts]: Start accepts. Automaton has 9399 states and 13078 transitions. Word has length 676 [2024-11-09 06:12:07,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:12:07,869 INFO L471 AbstractCegarLoop]: Abstraction has 9399 states and 13078 transitions. [2024-11-09 06:12:07,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 98.17647058823529) internal successors, (1669), 16 states have internal predecessors, (1669), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-09 06:12:07,870 INFO L276 IsEmpty]: Start isEmpty. Operand 9399 states and 13078 transitions. [2024-11-09 06:12:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1563 [2024-11-09 06:12:07,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:12:07,964 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:12:07,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 06:12:08,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:12:08,166 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:12:08,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:12:08,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1810814377, now seen corresponding path program 1 times [2024-11-09 06:12:08,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:12:08,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975451090] [2024-11-09 06:12:08,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:08,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms