./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da01f7e29b47732481465e941f69a1c8f9dd5529ae81cb8448eb7568570e2356 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:17:52,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:17:52,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 06:17:53,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:17:53,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:17:53,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:17:53,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:17:53,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:17:53,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 06:17:53,037 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 06:17:53,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:17:53,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:17:53,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:17:53,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:17:53,041 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:17:53,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:17:53,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:17:53,042 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:17:53,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:17:53,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:17:53,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:17:53,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:17:53,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:17:53,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:17:53,050 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:17:53,050 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:17:53,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:17:53,050 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:17:53,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:17:53,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:17:53,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:17:53,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:17:53,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:17:53,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:17:53,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:17:53,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:17:53,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:17:53,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:17:53,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:17:53,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:17:53,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:17:53,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:17:53,056 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 -> da01f7e29b47732481465e941f69a1c8f9dd5529ae81cb8448eb7568570e2356 [2024-11-09 06:17:53,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:17:53,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:17:53,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:17:53,394 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:17:53,395 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:17:53,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i [2024-11-09 06:17:55,025 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:17:55,372 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:17:55,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i [2024-11-09 06:17:55,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2bb4d930/ab74930a0126400d97529f6e09ba00a9/FLAG8ba65a178 [2024-11-09 06:17:55,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2bb4d930/ab74930a0126400d97529f6e09ba00a9 [2024-11-09 06:17:55,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:17:55,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:17:55,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:17:55,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:17:55,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:17:55,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:17:55" (1/1) ... [2024-11-09 06:17:55,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24dc5d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:55, skipping insertion in model container [2024-11-09 06:17:55,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:17:55" (1/1) ... [2024-11-09 06:17:55,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:17:56,179 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_OAT_test2-2.i[37019,37032] [2024-11-09 06:17:56,302 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_OAT_test2-2.i[47352,47365] [2024-11-09 06:17:56,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:17:56,343 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:17:56,385 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_OAT_test2-2.i[37019,37032] [2024-11-09 06:17:56,465 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_OAT_test2-2.i[47352,47365] [2024-11-09 06:17:56,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:17:56,554 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:17:56,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:56 WrapperNode [2024-11-09 06:17:56,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:17:56,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:17:56,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:17:56,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:17:56,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:56" (1/1) ... [2024-11-09 06:17:56,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:56" (1/1) ... [2024-11-09 06:17:56,720 INFO L138 Inliner]: procedures = 208, calls = 278, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1468 [2024-11-09 06:17:56,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:17:56,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:17:56,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:17:56,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:17:56,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:56" (1/1) ... [2024-11-09 06:17:56,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:56" (1/1) ... [2024-11-09 06:17:56,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:56" (1/1) ... [2024-11-09 06:17:56,852 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 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, 4, 50]. [2024-11-09 06:17:56,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:56" (1/1) ... [2024-11-09 06:17:56,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:56" (1/1) ... [2024-11-09 06:17:56,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:56" (1/1) ... [2024-11-09 06:17:56,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:56" (1/1) ... [2024-11-09 06:17:56,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:56" (1/1) ... [2024-11-09 06:17:56,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:56" (1/1) ... [2024-11-09 06:17:56,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:17:56,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:17:56,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:17:56,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:17:56,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:56" (1/1) ... [2024-11-09 06:17:56,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:17:56,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:17:56,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 06:17:56,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 06:17:57,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 06:17:57,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 06:17:57,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 06:17:57,043 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 06:17:57,043 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 06:17:57,044 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 06:17:57,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:17:57,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 06:17:57,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 06:17:57,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 06:17:57,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:17:57,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 06:17:57,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 06:17:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 06:17:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 06:17:57,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 06:17:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 06:17:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 06:17:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 06:17:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:17:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:17:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 06:17:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 06:17:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 06:17:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 06:17:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 06:17:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 06:17:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:17:57,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:17:57,339 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:17:57,341 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:17:59,195 INFO L? ?]: Removed 329 outVars from TransFormulas that were not future-live. [2024-11-09 06:17:59,196 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:17:59,230 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:17:59,230 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-09 06:17:59,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:17:59 BoogieIcfgContainer [2024-11-09 06:17:59,231 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:17:59,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:17:59,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:17:59,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:17:59,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:17:55" (1/3) ... [2024-11-09 06:17:59,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b492d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:17:59, skipping insertion in model container [2024-11-09 06:17:59,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:17:56" (2/3) ... [2024-11-09 06:17:59,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b492d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:17:59, skipping insertion in model container [2024-11-09 06:17:59,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:17:59" (3/3) ... [2024-11-09 06:17:59,242 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test2-2.i [2024-11-09 06:17:59,260 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:17:59,261 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 06:17:59,358 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:17:59,367 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;@7a2dda0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:17:59,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 06:17:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 416 states, 403 states have (on average 1.6228287841191067) internal successors, (654), 410 states have internal predecessors, (654), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:17:59,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 06:17:59,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:17:59,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:17:59,381 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:17:59,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:17:59,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1749664919, now seen corresponding path program 1 times [2024-11-09 06:17:59,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:17:59,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459386990] [2024-11-09 06:17:59,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:17:59,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:17:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:17:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:17:59,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:17:59,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459386990] [2024-11-09 06:17:59,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459386990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:17:59,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:17:59,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:17:59,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727142888] [2024-11-09 06:17:59,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:17:59,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 06:17:59,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:17:59,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 06:17:59,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:17:59,650 INFO L87 Difference]: Start difference. First operand has 416 states, 403 states have (on average 1.6228287841191067) internal successors, (654), 410 states have internal predecessors, (654), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:17:59,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:17:59,738 INFO L93 Difference]: Finished difference Result 830 states and 1343 transitions. [2024-11-09 06:17:59,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 06:17:59,741 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 06:17:59,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:17:59,760 INFO L225 Difference]: With dead ends: 830 [2024-11-09 06:17:59,761 INFO L226 Difference]: Without dead ends: 377 [2024-11-09 06:17:59,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:17:59,776 INFO L432 NwaCegarLoop]: 601 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, 601 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:17:59,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:17:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-09 06:17:59,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2024-11-09 06:17:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 365 states have (on average 1.4602739726027398) internal successors, (533), 371 states have internal predecessors, (533), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:17:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 549 transitions. [2024-11-09 06:17:59,859 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 549 transitions. Word has length 9 [2024-11-09 06:17:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:17:59,860 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 549 transitions. [2024-11-09 06:17:59,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:17:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 549 transitions. [2024-11-09 06:17:59,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 06:17:59,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:17:59,868 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:17:59,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:17:59,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:17:59,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:17:59,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2144728515, now seen corresponding path program 1 times [2024-11-09 06:17:59,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:17:59,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905441764] [2024-11-09 06:17:59,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:17:59,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:17:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:18:00,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:18:00,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905441764] [2024-11-09 06:18:00,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905441764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:00,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:00,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:18:00,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049520811] [2024-11-09 06:18:00,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:00,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:18:00,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:18:00,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:18:00,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:18:00,450 INFO L87 Difference]: Start difference. First operand 377 states and 549 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:00,647 INFO L93 Difference]: Finished difference Result 917 states and 1346 transitions. [2024-11-09 06:18:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:18:00,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-09 06:18:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:00,655 INFO L225 Difference]: With dead ends: 917 [2024-11-09 06:18:00,655 INFO L226 Difference]: Without dead ends: 741 [2024-11-09 06:18:00,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:18:00,658 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 518 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:00,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1669 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:18:00,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-09 06:18:00,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 379. [2024-11-09 06:18:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 367 states have (on average 1.457765667574932) internal successors, (535), 373 states have internal predecessors, (535), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 551 transitions. [2024-11-09 06:18:00,715 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 551 transitions. Word has length 64 [2024-11-09 06:18:00,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:00,715 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 551 transitions. [2024-11-09 06:18:00,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 551 transitions. [2024-11-09 06:18:00,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 06:18:00,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:00,728 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:00,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:18:00,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:18:00,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash 799714340, now seen corresponding path program 1 times [2024-11-09 06:18:00,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:18:00,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515912546] [2024-11-09 06:18:00,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:18:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:18:01,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:18:01,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515912546] [2024-11-09 06:18:01,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515912546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:01,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:01,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:18:01,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103761005] [2024-11-09 06:18:01,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:01,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:18:01,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:18:01,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:18:01,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:18:01,280 INFO L87 Difference]: Start difference. First operand 379 states and 551 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:01,387 INFO L93 Difference]: Finished difference Result 712 states and 1032 transitions. [2024-11-09 06:18:01,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:18:01,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2024-11-09 06:18:01,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:01,390 INFO L225 Difference]: With dead ends: 712 [2024-11-09 06:18:01,390 INFO L226 Difference]: Without dead ends: 337 [2024-11-09 06:18:01,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:18:01,396 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 30 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:01,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1322 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:18:01,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-09 06:18:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2024-11-09 06:18:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 325 states have (on average 1.4092307692307693) internal successors, (458), 331 states have internal predecessors, (458), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 474 transitions. [2024-11-09 06:18:01,419 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 474 transitions. Word has length 140 [2024-11-09 06:18:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:01,420 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 474 transitions. [2024-11-09 06:18:01,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 474 transitions. [2024-11-09 06:18:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 06:18:01,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:01,427 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:01,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:18:01,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:18:01,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1221731408, now seen corresponding path program 1 times [2024-11-09 06:18:01,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:18:01,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527021082] [2024-11-09 06:18:01,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:01,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:18:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:18:01,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:18:01,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527021082] [2024-11-09 06:18:01,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527021082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:01,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:01,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:18:01,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506644495] [2024-11-09 06:18:01,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:01,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:18:01,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:18:01,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:18:01,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:18:01,659 INFO L87 Difference]: Start difference. First operand 337 states and 474 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:01,732 INFO L93 Difference]: Finished difference Result 905 states and 1288 transitions. [2024-11-09 06:18:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:18:01,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2024-11-09 06:18:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:01,737 INFO L225 Difference]: With dead ends: 905 [2024-11-09 06:18:01,739 INFO L226 Difference]: Without dead ends: 572 [2024-11-09 06:18:01,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:18:01,741 INFO L432 NwaCegarLoop]: 661 mSDtfsCounter, 271 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:01,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1113 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:18:01,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-09 06:18:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 570. [2024-11-09 06:18:01,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 553 states have (on average 1.426763110307414) internal successors, (789), 564 states have internal predecessors, (789), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 06:18:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 815 transitions. [2024-11-09 06:18:01,774 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 815 transitions. Word has length 140 [2024-11-09 06:18:01,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:01,776 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 815 transitions. [2024-11-09 06:18:01,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:18:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 815 transitions. [2024-11-09 06:18:01,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 06:18:01,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:01,780 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:01,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:18:01,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:18:01,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:01,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1633621304, now seen corresponding path program 1 times [2024-11-09 06:18:01,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:18:01,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490393455] [2024-11-09 06:18:01,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:01,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:18:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:02,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:18:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:02,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:18:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:18:02,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:18:02,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490393455] [2024-11-09 06:18:02,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490393455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:02,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:02,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:18:02,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747343251] [2024-11-09 06:18:02,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:02,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:18:02,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:18:02,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:18:02,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:18:02,237 INFO L87 Difference]: Start difference. First operand 570 states and 815 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:18:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:02,592 INFO L93 Difference]: Finished difference Result 810 states and 1171 transitions. [2024-11-09 06:18:02,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:18:02,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-09 06:18:02,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:02,597 INFO L225 Difference]: With dead ends: 810 [2024-11-09 06:18:02,599 INFO L226 Difference]: Without dead ends: 489 [2024-11-09 06:18:02,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:18:02,602 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 38 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:02,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1339 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:18:02,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-09 06:18:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 486. [2024-11-09 06:18:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 469 states have (on average 1.3539445628997868) internal successors, (635), 480 states have internal predecessors, (635), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 06:18:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 661 transitions. [2024-11-09 06:18:02,632 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 661 transitions. Word has length 155 [2024-11-09 06:18:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:02,636 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 661 transitions. [2024-11-09 06:18:02,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:18:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 661 transitions. [2024-11-09 06:18:02,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 06:18:02,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:02,641 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:02,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:18:02,641 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:18:02,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1489831868, now seen corresponding path program 1 times [2024-11-09 06:18:02,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:18:02,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68765834] [2024-11-09 06:18:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:18:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:03,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:18:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:03,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:18:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:18:03,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:18:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68765834] [2024-11-09 06:18:03,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68765834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:03,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:03,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:18:03,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728034698] [2024-11-09 06:18:03,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:03,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:18:03,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:18:03,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:18:03,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:18:03,051 INFO L87 Difference]: Start difference. First operand 486 states and 661 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:18:03,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:03,597 INFO L93 Difference]: Finished difference Result 963 states and 1313 transitions. [2024-11-09 06:18:03,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:18:03,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-09 06:18:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:03,603 INFO L225 Difference]: With dead ends: 963 [2024-11-09 06:18:03,603 INFO L226 Difference]: Without dead ends: 568 [2024-11-09 06:18:03,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:18:03,607 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 808 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:03,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1494 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:18:03,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-09 06:18:03,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 382. [2024-11-09 06:18:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 370 states have (on average 1.3432432432432433) internal successors, (497), 376 states have internal predecessors, (497), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 06:18:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 513 transitions. [2024-11-09 06:18:03,632 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 513 transitions. Word has length 155 [2024-11-09 06:18:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:03,633 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 513 transitions. [2024-11-09 06:18:03,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:18:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 513 transitions. [2024-11-09 06:18:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 06:18:03,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:03,636 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:03,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:18:03,637 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:18:03,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:03,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1619982960, now seen corresponding path program 1 times [2024-11-09 06:18:03,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:18:03,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608465630] [2024-11-09 06:18:03,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:03,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:18:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:04,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:18:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:04,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:18:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:18:04,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:18:04,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608465630] [2024-11-09 06:18:04,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608465630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:18:04,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460829264] [2024-11-09 06:18:04,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:04,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:18:04,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:18:04,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:18:04,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:18:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:05,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:18:05,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:05,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:18:05,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 06:18:05,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 06:18:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:18:05,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:18:05,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:18:05,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460829264] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:18:05,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:18:05,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2024-11-09 06:18:05,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045758872] [2024-11-09 06:18:05,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:18:05,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:18:05,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:18:05,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:18:05,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:18:05,732 INFO L87 Difference]: Start difference. First operand 382 states and 513 transitions. Second operand has 12 states, 12 states have (on average 20.75) internal successors, (249), 11 states have internal predecessors, (249), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 06:18:06,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:06,339 INFO L93 Difference]: Finished difference Result 1271 states and 1722 transitions. [2024-11-09 06:18:06,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:18:06,340 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.75) internal successors, (249), 11 states have internal predecessors, (249), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 165 [2024-11-09 06:18:06,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:06,346 INFO L225 Difference]: With dead ends: 1271 [2024-11-09 06:18:06,346 INFO L226 Difference]: Without dead ends: 1137 [2024-11-09 06:18:06,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 327 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-09 06:18:06,349 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 2110 mSDsluCounter, 2078 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 2478 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:06,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2132 Valid, 2478 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:18:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2024-11-09 06:18:06,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 729. [2024-11-09 06:18:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 713 states have (on average 1.338008415147265) internal successors, (954), 719 states have internal predecessors, (954), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 06:18:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 976 transitions. [2024-11-09 06:18:06,388 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 976 transitions. Word has length 165 [2024-11-09 06:18:06,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:06,389 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 976 transitions. [2024-11-09 06:18:06,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.75) internal successors, (249), 11 states have internal predecessors, (249), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 06:18:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2024-11-09 06:18:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-09 06:18:06,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:06,395 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:06,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:18:06,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:18:06,597 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:18:06,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:06,598 INFO L85 PathProgramCache]: Analyzing trace with hash 95313527, now seen corresponding path program 1 times [2024-11-09 06:18:06,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:18:06,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942152007] [2024-11-09 06:18:06,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:06,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:18:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:11,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:18:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:11,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:18:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:18:11,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:18:11,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942152007] [2024-11-09 06:18:11,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942152007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:18:11,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856398580] [2024-11-09 06:18:11,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:11,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:18:11,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:18:11,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:18:11,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:18:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:12,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 06:18:12,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:12,305 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 15 treesize of output 1 [2024-11-09 06:18:12,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 06:18:12,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 06:18:12,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 06:18:12,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 06:18:12,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 06:18:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:18:12,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:18:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:18:13,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856398580] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:18:13,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:18:13,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2024-11-09 06:18:13,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690731073] [2024-11-09 06:18:13,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:18:13,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 06:18:13,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:18:13,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 06:18:13,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2024-11-09 06:18:13,537 INFO L87 Difference]: Start difference. First operand 729 states and 976 transitions. Second operand has 21 states, 21 states have (on average 33.857142857142854) internal successors, (711), 20 states have internal predecessors, (711), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 06:18:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:14,599 INFO L93 Difference]: Finished difference Result 2516 states and 3417 transitions. [2024-11-09 06:18:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 06:18:14,603 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 33.857142857142854) internal successors, (711), 20 states have internal predecessors, (711), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 393 [2024-11-09 06:18:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:14,614 INFO L225 Difference]: With dead ends: 2516 [2024-11-09 06:18:14,615 INFO L226 Difference]: Without dead ends: 2382 [2024-11-09 06:18:14,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 782 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2024-11-09 06:18:14,619 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 5803 mSDsluCounter, 4574 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5852 SdHoareTripleChecker+Valid, 4974 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:18:14,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5852 Valid, 4974 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:18:14,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2024-11-09 06:18:14,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 1593. [2024-11-09 06:18:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1571 states have (on average 1.336728198599618) internal successors, (2100), 1577 states have internal predecessors, (2100), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 06:18:14,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2134 transitions. [2024-11-09 06:18:14,739 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2134 transitions. Word has length 393 [2024-11-09 06:18:14,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:14,742 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2134 transitions. [2024-11-09 06:18:14,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 33.857142857142854) internal successors, (711), 20 states have internal predecessors, (711), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 06:18:14,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2134 transitions. [2024-11-09 06:18:14,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-11-09 06:18:14,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:14,769 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:14,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:18:14,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-09 06:18:14,972 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:18:14,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:14,973 INFO L85 PathProgramCache]: Analyzing trace with hash 2129905669, now seen corresponding path program 2 times [2024-11-09 06:18:14,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:18:14,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880426422] [2024-11-09 06:18:14,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:14,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms