./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_test3-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 2f1aaf5276e100f83cf10565e66c3b5d8c0baa3bbd1a1424b76fbee71241f226 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 11:49:56,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 11:49:56,964 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 11:49:56,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 11:49:56,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 11:49:56,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 11:49:56,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 11:49:56,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 11:49:56,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 11:49:56,998 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 11:49:56,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 11:49:56,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 11:49:56,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 11:49:56,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 11:49:56,999 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 11:49:57,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 11:49:57,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 11:49:57,000 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 11:49:57,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 11:49:57,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 11:49:57,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 11:49:57,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 11:49:57,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 11:49:57,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 11:49:57,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 11:49:57,004 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 11:49:57,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 11:49:57,004 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 11:49:57,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 11:49:57,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 11:49:57,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 11:49:57,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 11:49:57,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 11:49:57,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 11:49:57,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 11:49:57,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 11:49:57,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 11:49:57,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 11:49:57,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 11:49:57,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 11:49:57,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 11:49:57,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 11:49:57,008 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 -> 2f1aaf5276e100f83cf10565e66c3b5d8c0baa3bbd1a1424b76fbee71241f226 [2024-11-12 11:49:57,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 11:49:57,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 11:49:57,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 11:49:57,241 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 11:49:57,241 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 11:49:57,242 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_test3-1.i [2024-11-12 11:49:58,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 11:49:58,900 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 11:49:58,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i [2024-11-12 11:49:58,916 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f98b58e8/6f9a9223cff140a59c3251179ea72015/FLAG2406b8441 [2024-11-12 11:49:58,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f98b58e8/6f9a9223cff140a59c3251179ea72015 [2024-11-12 11:49:58,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 11:49:58,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 11:49:58,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 11:49:58,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 11:49:58,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 11:49:58,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:49:58" (1/1) ... [2024-11-12 11:49:58,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7165c9c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:49:58, skipping insertion in model container [2024-11-12 11:49:58,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:49:58" (1/1) ... [2024-11-12 11:49:58,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 11:49:59,313 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_test3-1.i[33021,33034] [2024-11-12 11:49:59,428 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_test3-1.i[44590,44603] [2024-11-12 11:49:59,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 11:49:59,443 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 11:49:59,464 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_test3-1.i[33021,33034] [2024-11-12 11:49:59,505 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_test3-1.i[44590,44603] [2024-11-12 11:49:59,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 11:49:59,540 INFO L204 MainTranslator]: Completed translation [2024-11-12 11:49:59,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:49:59 WrapperNode [2024-11-12 11:49:59,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 11:49:59,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 11:49:59,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 11:49:59,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 11:49:59,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:49:59" (1/1) ... [2024-11-12 11:49:59,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:49:59" (1/1) ... [2024-11-12 11:49:59,636 INFO L138 Inliner]: procedures = 177, calls = 277, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1455 [2024-11-12 11:49:59,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 11:49:59,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 11:49:59,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 11:49:59,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 11:49:59,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:49:59" (1/1) ... [2024-11-12 11:49:59,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:49:59" (1/1) ... [2024-11-12 11:49:59,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:49:59" (1/1) ... [2024-11-12 11:49:59,731 INFO L175 MemorySlicer]: Split 255 memory accesses to 3 slices as follows [2, 219, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-12 11:49:59,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:49:59" (1/1) ... [2024-11-12 11:49:59,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:49:59" (1/1) ... [2024-11-12 11:49:59,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:49:59" (1/1) ... [2024-11-12 11:49:59,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:49:59" (1/1) ... [2024-11-12 11:49:59,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:49:59" (1/1) ... [2024-11-12 11:49:59,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:49:59" (1/1) ... [2024-11-12 11:49:59,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 11:49:59,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 11:49:59,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 11:49:59,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 11:49:59,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:49:59" (1/1) ... [2024-11-12 11:49:59,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 11:49:59,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 11:49:59,842 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-12 11:49:59,850 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-12 11:49:59,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 11:49:59,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 11:49:59,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 11:49:59,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 11:49:59,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 11:49:59,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 11:49:59,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 11:49:59,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 11:49:59,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 11:49:59,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 11:49:59,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-12 11:49:59,884 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 11:49:59,884 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 11:49:59,885 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-12 11:49:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 11:49:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 11:49:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 11:49:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 11:49:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 11:49:59,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 11:49:59,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 11:49:59,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 11:49:59,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 11:49:59,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 11:49:59,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 11:49:59,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 11:49:59,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 11:49:59,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 11:49:59,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 11:50:00,084 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 11:50:00,086 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 11:50:01,464 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2024-11-12 11:50:01,464 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 11:50:01,480 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 11:50:01,480 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-12 11:50:01,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:50:01 BoogieIcfgContainer [2024-11-12 11:50:01,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 11:50:01,482 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 11:50:01,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 11:50:01,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 11:50:01,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 11:49:58" (1/3) ... [2024-11-12 11:50:01,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee5f92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:50:01, skipping insertion in model container [2024-11-12 11:50:01,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:49:59" (2/3) ... [2024-11-12 11:50:01,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee5f92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:50:01, skipping insertion in model container [2024-11-12 11:50:01,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:50:01" (3/3) ... [2024-11-12 11:50:01,489 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test3-1.i [2024-11-12 11:50:01,513 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 11:50:01,513 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 11:50:01,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 11:50:01,598 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;@4b2a7f98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 11:50:01,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 11:50:01,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 412 states, 399 states have (on average 1.6240601503759398) internal successors, (648), 406 states have internal predecessors, (648), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 11:50:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 11:50:01,610 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:50:01,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:50:01,611 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:50:01,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:50:01,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1749667479, now seen corresponding path program 1 times [2024-11-12 11:50:01,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:50:01,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754052713] [2024-11-12 11:50:01,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:50:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:01,762 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-12 11:50:01,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:50:01,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754052713] [2024-11-12 11:50:01,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754052713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:50:01,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:50:01,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 11:50:01,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218991504] [2024-11-12 11:50:01,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:50:01,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 11:50:01,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:50:01,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 11:50:01,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 11:50:01,789 INFO L87 Difference]: Start difference. First operand has 412 states, 399 states have (on average 1.6240601503759398) internal successors, (648), 406 states have internal predecessors, (648), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:50:01,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:50:01,844 INFO L93 Difference]: Finished difference Result 822 states and 1331 transitions. [2024-11-12 11:50:01,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 11:50:01,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-12 11:50:01,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:50:01,858 INFO L225 Difference]: With dead ends: 822 [2024-11-12 11:50:01,859 INFO L226 Difference]: Without dead ends: 408 [2024-11-12 11:50:01,863 INFO L434 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-12 11:50:01,865 INFO L435 NwaCegarLoop]: 595 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, 595 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-12 11:50:01,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 11:50:01,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-12 11:50:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2024-11-12 11:50:01,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 396 states have (on average 1.452020202020202) internal successors, (575), 402 states have internal predecessors, (575), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 11:50:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 591 transitions. [2024-11-12 11:50:01,917 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 591 transitions. Word has length 9 [2024-11-12 11:50:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:50:01,918 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 591 transitions. [2024-11-12 11:50:01,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:50:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 591 transitions. [2024-11-12 11:50:01,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 11:50:01,921 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:50:01,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:50:01,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 11:50:01,922 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:50:01,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:50:01,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1635991573, now seen corresponding path program 1 times [2024-11-12 11:50:01,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:50:01,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429837525] [2024-11-12 11:50:01,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:01,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:50:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:02,064 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-12 11:50:02,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:50:02,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429837525] [2024-11-12 11:50:02,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429837525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:50:02,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:50:02,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 11:50:02,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185498015] [2024-11-12 11:50:02,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:50:02,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 11:50:02,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:50:02,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 11:50:02,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 11:50:02,067 INFO L87 Difference]: Start difference. First operand 408 states and 591 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:50:02,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:50:02,231 INFO L93 Difference]: Finished difference Result 1010 states and 1472 transitions. [2024-11-12 11:50:02,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 11:50:02,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-12 11:50:02,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:50:02,235 INFO L225 Difference]: With dead ends: 1010 [2024-11-12 11:50:02,235 INFO L226 Difference]: Without dead ends: 803 [2024-11-12 11:50:02,236 INFO L434 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-12 11:50:02,237 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 560 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 11:50:02,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1709 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 11:50:02,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-11-12 11:50:02,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 410. [2024-11-12 11:50:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 398 states have (on average 1.449748743718593) internal successors, (577), 404 states have internal predecessors, (577), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 11:50:02,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 593 transitions. [2024-11-12 11:50:02,259 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 593 transitions. Word has length 14 [2024-11-12 11:50:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:50:02,260 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 593 transitions. [2024-11-12 11:50:02,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:50:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 593 transitions. [2024-11-12 11:50:02,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 11:50:02,264 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:50:02,264 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:50:02,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 11:50:02,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:50:02,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:50:02,266 INFO L85 PathProgramCache]: Analyzing trace with hash 714752182, now seen corresponding path program 1 times [2024-11-12 11:50:02,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:50:02,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102084232] [2024-11-12 11:50:02,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:02,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:50:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:50:02,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:50:02,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102084232] [2024-11-12 11:50:02,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102084232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:50:02,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:50:02,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 11:50:02,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047123621] [2024-11-12 11:50:02,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:50:02,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 11:50:02,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:50:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 11:50:02,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 11:50:02,579 INFO L87 Difference]: Start difference. First operand 410 states and 593 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:50:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:50:02,648 INFO L93 Difference]: Finished difference Result 774 states and 1116 transitions. [2024-11-12 11:50:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 11:50:02,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-12 11:50:02,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:50:02,651 INFO L225 Difference]: With dead ends: 774 [2024-11-12 11:50:02,651 INFO L226 Difference]: Without dead ends: 368 [2024-11-12 11:50:02,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 11:50:02,652 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 30 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 11:50:02,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1448 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 11:50:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-12 11:50:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2024-11-12 11:50:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 356 states have (on average 1.404494382022472) internal successors, (500), 362 states have internal predecessors, (500), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 11:50:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 516 transitions. [2024-11-12 11:50:02,669 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 516 transitions. Word has length 90 [2024-11-12 11:50:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:50:02,669 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 516 transitions. [2024-11-12 11:50:02,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:50:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 516 transitions. [2024-11-12 11:50:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 11:50:02,672 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:50:02,673 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:50:02,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 11:50:02,673 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:50:02,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:50:02,674 INFO L85 PathProgramCache]: Analyzing trace with hash -654857406, now seen corresponding path program 1 times [2024-11-12 11:50:02,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:50:02,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073145448] [2024-11-12 11:50:02,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:02,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:50:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:50:02,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:50:02,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073145448] [2024-11-12 11:50:02,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073145448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:50:02,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:50:02,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 11:50:02,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645670464] [2024-11-12 11:50:02,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:50:02,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 11:50:02,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:50:02,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 11:50:02,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 11:50:02,789 INFO L87 Difference]: Start difference. First operand 368 states and 516 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:50:02,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:50:02,873 INFO L93 Difference]: Finished difference Result 983 states and 1389 transitions. [2024-11-12 11:50:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 11:50:02,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-12 11:50:02,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:50:02,875 INFO L225 Difference]: With dead ends: 983 [2024-11-12 11:50:02,875 INFO L226 Difference]: Without dead ends: 619 [2024-11-12 11:50:02,876 INFO L434 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-12 11:50:02,877 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 295 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 11:50:02,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1178 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 11:50:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-12 11:50:02,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2024-11-12 11:50:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 603 states have (on average 1.4195688225538972) internal successors, (856), 609 states have internal predecessors, (856), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 11:50:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 872 transitions. [2024-11-12 11:50:02,888 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 872 transitions. Word has length 90 [2024-11-12 11:50:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:50:02,889 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 872 transitions. [2024-11-12 11:50:02,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:50:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 872 transitions. [2024-11-12 11:50:02,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-12 11:50:02,894 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:50:02,894 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:50:02,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 11:50:02,894 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:50:02,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:50:02,895 INFO L85 PathProgramCache]: Analyzing trace with hash 581917402, now seen corresponding path program 1 times [2024-11-12 11:50:02,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:50:02,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204330042] [2024-11-12 11:50:02,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:02,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:50:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:03,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 11:50:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:03,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 11:50:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 11:50:03,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:50:03,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204330042] [2024-11-12 11:50:03,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204330042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:50:03,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:50:03,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 11:50:03,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658085478] [2024-11-12 11:50:03,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:50:03,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 11:50:03,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:50:03,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 11:50:03,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 11:50:03,314 INFO L87 Difference]: Start difference. First operand 615 states and 872 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 11:50:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:50:03,581 INFO L93 Difference]: Finished difference Result 917 states and 1306 transitions. [2024-11-12 11:50:03,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 11:50:03,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2024-11-12 11:50:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:50:03,591 INFO L225 Difference]: With dead ends: 917 [2024-11-12 11:50:03,592 INFO L226 Difference]: Without dead ends: 896 [2024-11-12 11:50:03,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-12 11:50:03,594 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 466 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 11:50:03,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1834 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 11:50:03,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-11-12 11:50:03,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 617. [2024-11-12 11:50:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 605 states have (on average 1.4181818181818182) internal successors, (858), 611 states have internal predecessors, (858), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 11:50:03,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 874 transitions. [2024-11-12 11:50:03,621 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 874 transitions. Word has length 105 [2024-11-12 11:50:03,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:50:03,624 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 874 transitions. [2024-11-12 11:50:03,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 11:50:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 874 transitions. [2024-11-12 11:50:03,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-12 11:50:03,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:50:03,630 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:50:03,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 11:50:03,630 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:50:03,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:50:03,631 INFO L85 PathProgramCache]: Analyzing trace with hash 957710152, now seen corresponding path program 1 times [2024-11-12 11:50:03,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:50:03,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225532366] [2024-11-12 11:50:03,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:03,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:50:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:03,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 11:50:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:03,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 11:50:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 11:50:03,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:50:03,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225532366] [2024-11-12 11:50:03,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225532366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:50:03,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:50:03,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 11:50:03,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765901861] [2024-11-12 11:50:03,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:50:03,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 11:50:03,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:50:03,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 11:50:03,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 11:50:03,924 INFO L87 Difference]: Start difference. First operand 617 states and 874 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 11:50:04,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:50:04,183 INFO L93 Difference]: Finished difference Result 902 states and 1287 transitions. [2024-11-12 11:50:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 11:50:04,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-12 11:50:04,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:50:04,186 INFO L225 Difference]: With dead ends: 902 [2024-11-12 11:50:04,187 INFO L226 Difference]: Without dead ends: 536 [2024-11-12 11:50:04,187 INFO L434 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-12 11:50:04,188 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 38 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 11:50:04,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1488 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 11:50:04,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-12 11:50:04,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 533. [2024-11-12 11:50:04,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 521 states have (on average 1.3512476007677543) internal successors, (704), 527 states have internal predecessors, (704), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 11:50:04,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 720 transitions. [2024-11-12 11:50:04,204 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 720 transitions. Word has length 155 [2024-11-12 11:50:04,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:50:04,205 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 720 transitions. [2024-11-12 11:50:04,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 11:50:04,206 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 720 transitions. [2024-11-12 11:50:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-12 11:50:04,209 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:50:04,209 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:50:04,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 11:50:04,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:50:04,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:50:04,211 INFO L85 PathProgramCache]: Analyzing trace with hash -213803972, now seen corresponding path program 1 times [2024-11-12 11:50:04,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:50:04,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399387617] [2024-11-12 11:50:04,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:04,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:50:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:04,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 11:50:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:04,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 11:50:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 11:50:04,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:50:04,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399387617] [2024-11-12 11:50:04,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399387617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:50:04,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:50:04,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 11:50:04,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136252662] [2024-11-12 11:50:04,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:50:04,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 11:50:04,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:50:04,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 11:50:04,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 11:50:04,564 INFO L87 Difference]: Start difference. First operand 533 states and 720 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 11:50:05,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:50:05,031 INFO L93 Difference]: Finished difference Result 1336 states and 1814 transitions. [2024-11-12 11:50:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 11:50:05,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-12 11:50:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:50:05,045 INFO L225 Difference]: With dead ends: 1336 [2024-11-12 11:50:05,045 INFO L226 Difference]: Without dead ends: 894 [2024-11-12 11:50:05,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-12 11:50:05,050 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 1172 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 11:50:05,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 1921 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 11:50:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-11-12 11:50:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 672. [2024-11-12 11:50:05,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 660 states have (on average 1.353030303030303) internal successors, (893), 666 states have internal predecessors, (893), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 11:50:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 909 transitions. [2024-11-12 11:50:05,095 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 909 transitions. Word has length 155 [2024-11-12 11:50:05,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:50:05,095 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 909 transitions. [2024-11-12 11:50:05,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 11:50:05,096 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 909 transitions. [2024-11-12 11:50:05,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 11:50:05,101 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:50:05,101 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:50:05,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 11:50:05,102 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:50:05,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:50:05,102 INFO L85 PathProgramCache]: Analyzing trace with hash 884502256, now seen corresponding path program 1 times [2024-11-12 11:50:05,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:50:05,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932168462] [2024-11-12 11:50:05,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:05,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:50:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:05,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 11:50:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:05,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 11:50:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 11:50:05,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:50:05,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932168462] [2024-11-12 11:50:05,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932168462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 11:50:05,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632799995] [2024-11-12 11:50:05,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:05,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 11:50:05,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 11:50:05,789 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-12 11:50:05,794 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-12 11:50:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:06,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 11:50:06,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 11:50:06,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 11:50:06,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-12 11:50:06,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 11:50:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 11:50:06,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 11:50:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 11:50:06,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632799995] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 11:50:06,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 11:50:06,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2024-11-12 11:50:06,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291314531] [2024-11-12 11:50:06,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 11:50:06,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 11:50:06,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:50:06,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 11:50:06,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-12 11:50:06,459 INFO L87 Difference]: Start difference. First operand 672 states and 909 transitions. Second operand has 12 states, 12 states have (on average 27.25) internal successors, (327), 11 states have internal predecessors, (327), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 11:50:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:50:06,924 INFO L93 Difference]: Finished difference Result 2172 states and 2948 transitions. [2024-11-12 11:50:06,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 11:50:06,925 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 27.25) internal successors, (327), 11 states have internal predecessors, (327), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 165 [2024-11-12 11:50:06,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:50:06,931 INFO L225 Difference]: With dead ends: 2172 [2024-11-12 11:50:06,931 INFO L226 Difference]: Without dead ends: 1748 [2024-11-12 11:50:06,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 327 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-11-12 11:50:06,932 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 2256 mSDsluCounter, 2493 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2269 SdHoareTripleChecker+Valid, 2943 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 11:50:06,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2269 Valid, 2943 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 11:50:06,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2024-11-12 11:50:06,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1019. [2024-11-12 11:50:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1003 states have (on average 1.345962113659023) internal successors, (1350), 1009 states have internal predecessors, (1350), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 11:50:06,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1372 transitions. [2024-11-12 11:50:06,963 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1372 transitions. Word has length 165 [2024-11-12 11:50:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:50:06,963 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1372 transitions. [2024-11-12 11:50:06,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.25) internal successors, (327), 11 states have internal predecessors, (327), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 11:50:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1372 transitions. [2024-11-12 11:50:06,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-12 11:50:06,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:50:06,967 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:50:06,987 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-12 11:50:07,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 11:50:07,169 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:50:07,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:50:07,170 INFO L85 PathProgramCache]: Analyzing trace with hash 924357367, now seen corresponding path program 1 times [2024-11-12 11:50:07,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:50:07,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475758956] [2024-11-12 11:50:07,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:07,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:50:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:10,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 11:50:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:10,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 11:50:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 11:50:10,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:50:10,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475758956] [2024-11-12 11:50:10,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475758956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 11:50:10,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674747727] [2024-11-12 11:50:10,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:10,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 11:50:10,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 11:50:10,241 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-12 11:50:10,242 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-12 11:50:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:50:10,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 11:50:10,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 11:50:10,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 11:50:10,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-12 11:50:11,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-12 11:50:11,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-12 11:50:11,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-12 11:50:11,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 11:50:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 11:50:11,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 11:50:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 11:50:11,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674747727] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 11:50:11,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 11:50:11,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2024-11-12 11:50:11,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127861033] [2024-11-12 11:50:11,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 11:50:11,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 11:50:11,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:50:11,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 11:50:11,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2024-11-12 11:50:11,706 INFO L87 Difference]: Start difference. First operand 1019 states and 1372 transitions. Second operand has 20 states, 20 states have (on average 39.35) internal successors, (787), 19 states have internal predecessors, (787), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 11:50:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:50:12,651 INFO L93 Difference]: Finished difference Result 4281 states and 5825 transitions. [2024-11-12 11:50:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 11:50:12,653 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 39.35) internal successors, (787), 19 states have internal predecessors, (787), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 393 [2024-11-12 11:50:12,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:50:12,669 INFO L225 Difference]: With dead ends: 4281 [2024-11-12 11:50:12,670 INFO L226 Difference]: Without dead ends: 3857 [2024-11-12 11:50:12,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 782 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2024-11-12 11:50:12,674 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 5029 mSDsluCounter, 4929 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5069 SdHoareTripleChecker+Valid, 5380 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 11:50:12,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5069 Valid, 5380 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 11:50:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3857 states. [2024-11-12 11:50:12,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3857 to 1883. [2024-11-12 11:50:12,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1861 states have (on average 1.3412144008597529) internal successors, (2496), 1867 states have internal predecessors, (2496), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 11:50:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 2530 transitions. [2024-11-12 11:50:12,751 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 2530 transitions. Word has length 393 [2024-11-12 11:50:12,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:50:12,752 INFO L471 AbstractCegarLoop]: Abstraction has 1883 states and 2530 transitions. [2024-11-12 11:50:12,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 39.35) internal successors, (787), 19 states have internal predecessors, (787), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 11:50:12,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2530 transitions. [2024-11-12 11:50:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-11-12 11:50:12,766 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:50:12,766 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:50:12,785 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-12 11:50:12,967 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,SelfDestructingSolverStorable8 [2024-11-12 11:50:12,968 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:50:12,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:50:12,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1061192571, now seen corresponding path program 2 times [2024-11-12 11:50:12,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:50:12,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472789484] [2024-11-12 11:50:12,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:50:12,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms