./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/bin/uautomizer-verify-4GaUIPS5ZU --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 d993ff45e37665d9abd93530677e1201b0648bf8ee13fa84b0c68926f580d988 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:04:37,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:04:38,008 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:04:38,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:04:38,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:04:38,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:04:38,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:04:38,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:04:38,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:04:38,074 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:04:38,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:04:38,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:04:38,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:04:38,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:04:38,080 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:04:38,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:04:38,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:04:38,082 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:04:38,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:04:38,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:04:38,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:04:38,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:04:38,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:04:38,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:04:38,089 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:04:38,090 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:04:38,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:04:38,093 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:04:38,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:04:38,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:04:38,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:04:38,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:04:38,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:04:38,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:04:38,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:04:38,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:04:38,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:04:38,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:04:38,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:04:38,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:04:38,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:04:38,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:04:38,102 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/bin/uautomizer-verify-4GaUIPS5ZU 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 -> d993ff45e37665d9abd93530677e1201b0648bf8ee13fa84b0c68926f580d988 [2024-10-31 22:04:38,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:04:38,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:04:38,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:04:38,501 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:04:38,501 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:04:38,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i Unable to find full path for "g++" [2024-10-31 22:04:40,869 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:04:41,279 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:04:41,280 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i [2024-10-31 22:04:41,306 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/bin/uautomizer-verify-4GaUIPS5ZU/data/80b698413/2eb80c824c5c41d88a9de6ce3d1b2638/FLAG54c583490 [2024-10-31 22:04:41,324 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/bin/uautomizer-verify-4GaUIPS5ZU/data/80b698413/2eb80c824c5c41d88a9de6ce3d1b2638 [2024-10-31 22:04:41,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:04:41,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:04:41,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:41,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:04:41,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:04:41,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:41" (1/1) ... [2024-10-31 22:04:41,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207c7078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:41, skipping insertion in model container [2024-10-31 22:04:41,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:41" (1/1) ... [2024-10-31 22:04:41,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:04:42,161 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i[33021,33034] [2024-10-31 22:04:42,549 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i[84583,84596] [2024-10-31 22:04:42,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:42,587 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:04:42,628 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i[33021,33034] [2024-10-31 22:04:42,843 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i[84583,84596] [2024-10-31 22:04:42,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:42,904 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:04:42,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42 WrapperNode [2024-10-31 22:04:42,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:42,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:42,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:04:42,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:04:42,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:42,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:43,198 INFO L138 Inliner]: procedures = 177, calls = 773, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3448 [2024-10-31 22:04:43,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:43,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:04:43,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:04:43,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:04:43,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:43,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:43,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:43,480 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-10-31 22:04:43,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:43,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:43,598 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:43,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:43,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:43,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:43,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:04:43,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:04:43,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:04:43,714 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:04:43,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:43,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:04:43,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:04:43,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:04:43,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e8e6b49-11b8-4c90-86ba-0a356389c537/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:04:43,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:04:43,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:04:43,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 22:04:43,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-31 22:04:43,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-31 22:04:43,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:04:43,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:04:43,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 22:04:43,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-31 22:04:43,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-31 22:04:43,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-31 22:04:43,807 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-31 22:04:43,808 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-31 22:04:43,808 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-31 22:04:43,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:04:43,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:04:43,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-31 22:04:43,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-31 22:04:43,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-31 22:04:43,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-31 22:04:43,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-31 22:04:43,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-31 22:04:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-31 22:04:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:04:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:04:43,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:04:43,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 22:04:43,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:04:43,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:04:44,164 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:04:44,167 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:04:48,407 INFO L? ?]: Removed 824 outVars from TransFormulas that were not future-live. [2024-10-31 22:04:48,408 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:04:48,463 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:04:48,463 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-31 22:04:48,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:48 BoogieIcfgContainer [2024-10-31 22:04:48,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:04:48,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:04:48,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:04:48,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:04:48,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:04:41" (1/3) ... [2024-10-31 22:04:48,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20de8cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:48, skipping insertion in model container [2024-10-31 22:04:48,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (2/3) ... [2024-10-31 22:04:48,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20de8cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:48, skipping insertion in model container [2024-10-31 22:04:48,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:48" (3/3) ... [2024-10-31 22:04:48,478 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test9-2.i [2024-10-31 22:04:48,500 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:04:48,500 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-31 22:04:48,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:04:48,674 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;@be72101, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:04:48,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-31 22:04:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 1406 states, 898 states have (on average 1.8307349665924275) internal successors, (1644), 1400 states have internal predecessors, (1644), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-31 22:04:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-31 22:04:48,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:48,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:48,697 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:48,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1749759959, now seen corresponding path program 1 times [2024-10-31 22:04:48,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:48,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058810060] [2024-10-31 22:04:48,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:48,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:48,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058810060] [2024-10-31 22:04:48,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058810060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:48,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:48,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:04:48,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104583968] [2024-10-31 22:04:48,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:48,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:04:48,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:48,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:04:48,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:04:49,000 INFO L87 Difference]: Start difference. First operand has 1406 states, 898 states have (on average 1.8307349665924275) internal successors, (1644), 1400 states have internal predecessors, (1644), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) 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-10-31 22:04:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:49,294 INFO L93 Difference]: Finished difference Result 2810 states and 5798 transitions. [2024-10-31 22:04:49,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:04:49,296 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-10-31 22:04:49,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:49,353 INFO L225 Difference]: With dead ends: 2810 [2024-10-31 22:04:49,353 INFO L226 Difference]: Without dead ends: 1367 [2024-10-31 22:04:49,375 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-10-31 22:04:49,379 INFO L432 NwaCegarLoop]: 2581 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, 2581 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-10-31 22:04:49,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2581 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:04:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2024-10-31 22:04:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1367. [2024-10-31 22:04:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 860 states have (on average 1.7709302325581395) internal successors, (1523), 1361 states have internal predecessors, (1523), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-31 22:04:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 2529 transitions. [2024-10-31 22:04:50,095 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 2529 transitions. Word has length 9 [2024-10-31 22:04:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:50,098 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 2529 transitions. [2024-10-31 22:04:50,156 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-10-31 22:04:50,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2529 transitions. [2024-10-31 22:04:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-31 22:04:50,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:50,171 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-10-31 22:04:50,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:04:50,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:50,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2144823555, now seen corresponding path program 1 times [2024-10-31 22:04:50,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:50,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770769960] [2024-10-31 22:04:50,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:50,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:50,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:50,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770769960] [2024-10-31 22:04:50,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770769960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:50,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:50,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:04:50,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079225684] [2024-10-31 22:04:50,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:50,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:04:50,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:50,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:04:50,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:04:50,701 INFO L87 Difference]: Start difference. First operand 1367 states and 2529 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-10-31 22:04:52,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:52,166 INFO L93 Difference]: Finished difference Result 3887 states and 7286 transitions. [2024-10-31 22:04:52,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:04:52,167 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-10-31 22:04:52,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:52,195 INFO L225 Difference]: With dead ends: 3887 [2024-10-31 22:04:52,196 INFO L226 Difference]: Without dead ends: 2721 [2024-10-31 22:04:52,203 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-10-31 22:04:52,204 INFO L432 NwaCegarLoop]: 2756 mSDtfsCounter, 1508 mSDsluCounter, 4760 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 7516 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:52,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 7516 Invalid, 562 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-31 22:04:52,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2024-10-31 22:04:52,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 1369. [2024-10-31 22:04:52,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 862 states have (on average 1.7691415313225058) internal successors, (1525), 1363 states have internal predecessors, (1525), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-31 22:04:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2531 transitions. [2024-10-31 22:04:52,625 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2531 transitions. Word has length 64 [2024-10-31 22:04:52,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:52,626 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2531 transitions. [2024-10-31 22:04:52,626 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-10-31 22:04:52,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2531 transitions. [2024-10-31 22:04:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-31 22:04:52,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:52,632 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-10-31 22:04:52,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:04:52,632 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:52,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash 799809380, now seen corresponding path program 1 times [2024-10-31 22:04:52,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:52,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653763790] [2024-10-31 22:04:52,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:52,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:53,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:53,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653763790] [2024-10-31 22:04:53,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653763790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:53,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:53,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:04:53,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238324152] [2024-10-31 22:04:53,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:53,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:04:53,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:53,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:04:53,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:04:53,202 INFO L87 Difference]: Start difference. First operand 1369 states and 2531 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-10-31 22:04:53,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:53,453 INFO L93 Difference]: Finished difference Result 2692 states and 4992 transitions. [2024-10-31 22:04:53,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:04:53,454 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-10-31 22:04:53,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:53,471 INFO L225 Difference]: With dead ends: 2692 [2024-10-31 22:04:53,471 INFO L226 Difference]: Without dead ends: 1327 [2024-10-31 22:04:53,481 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-10-31 22:04:53,482 INFO L432 NwaCegarLoop]: 2427 mSDtfsCounter, 30 mSDsluCounter, 4835 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7262 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-10-31 22:04:53,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7262 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:04:53,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2024-10-31 22:04:53,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1327. [2024-10-31 22:04:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 820 states have (on average 1.7658536585365854) internal successors, (1448), 1321 states have internal predecessors, (1448), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-31 22:04:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 2454 transitions. [2024-10-31 22:04:53,749 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 2454 transitions. Word has length 140 [2024-10-31 22:04:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:53,749 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 2454 transitions. [2024-10-31 22:04:53,750 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-10-31 22:04:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 2454 transitions. [2024-10-31 22:04:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-31 22:04:53,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:53,752 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-10-31 22:04:53,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:04:53,753 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:53,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:53,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1221636368, now seen corresponding path program 1 times [2024-10-31 22:04:53,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:53,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115985918] [2024-10-31 22:04:53,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:53,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:54,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:54,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115985918] [2024-10-31 22:04:54,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115985918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:54,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:54,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:04:54,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900965683] [2024-10-31 22:04:54,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:54,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:54,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:54,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:54,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:54,030 INFO L87 Difference]: Start difference. First operand 1327 states and 2454 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-10-31 22:04:54,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:54,324 INFO L93 Difference]: Finished difference Result 3875 states and 7228 transitions. [2024-10-31 22:04:54,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:54,325 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-10-31 22:04:54,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:54,348 INFO L225 Difference]: With dead ends: 3875 [2024-10-31 22:04:54,349 INFO L226 Difference]: Without dead ends: 2552 [2024-10-31 22:04:54,356 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-10-31 22:04:54,361 INFO L432 NwaCegarLoop]: 2891 mSDtfsCounter, 1261 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 5323 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:54,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 5323 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:04:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2024-10-31 22:04:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2550. [2024-10-31 22:04:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 1543 states have (on average 1.7945560596241088) internal successors, (2769), 2544 states have internal predecessors, (2769), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-31 22:04:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 4775 transitions. [2024-10-31 22:04:54,831 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 4775 transitions. Word has length 140 [2024-10-31 22:04:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:54,833 INFO L471 AbstractCegarLoop]: Abstraction has 2550 states and 4775 transitions. [2024-10-31 22:04:54,833 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-10-31 22:04:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 4775 transitions. [2024-10-31 22:04:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-31 22:04:54,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:54,836 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-10-31 22:04:54,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:04:54,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:54,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:54,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1150455944, now seen corresponding path program 1 times [2024-10-31 22:04:54,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:54,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390655110] [2024-10-31 22:04:54,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:54,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:55,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:04:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:55,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-31 22:04:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-31 22:04:55,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:55,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390655110] [2024-10-31 22:04:55,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390655110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:55,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:55,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:04:55,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562496260] [2024-10-31 22:04:55,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:55,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:04:55,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:55,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:04:55,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:04:55,363 INFO L87 Difference]: Start difference. First operand 2550 states and 4775 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-10-31 22:04:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:59,233 INFO L93 Difference]: Finished difference Result 4770 states and 9091 transitions. [2024-10-31 22:04:59,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:04:59,234 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-10-31 22:04:59,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:59,262 INFO L225 Difference]: With dead ends: 4770 [2024-10-31 22:04:59,262 INFO L226 Difference]: Without dead ends: 2469 [2024-10-31 22:04:59,275 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-10-31 22:04:59,276 INFO L432 NwaCegarLoop]: 2338 mSDtfsCounter, 38 mSDsluCounter, 4941 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 7279 SdHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:59,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 7279 Invalid, 2160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-31 22:04:59,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2024-10-31 22:04:59,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2466. [2024-10-31 22:04:59,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 1459 states have (on average 1.792323509252913) internal successors, (2615), 2460 states have internal predecessors, (2615), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-31 22:04:59,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 4621 transitions. [2024-10-31 22:04:59,865 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 4621 transitions. Word has length 155 [2024-10-31 22:04:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:59,869 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 4621 transitions. [2024-10-31 22:04:59,870 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-10-31 22:04:59,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 4621 transitions. [2024-10-31 22:04:59,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-31 22:04:59,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:59,878 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-10-31 22:04:59,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:04:59,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:59,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash -21058180, now seen corresponding path program 1 times [2024-10-31 22:04:59,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:59,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085879706] [2024-10-31 22:04:59,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:59,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:00,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:05:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:00,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-31 22:05:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-31 22:05:00,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:00,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085879706] [2024-10-31 22:05:00,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085879706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:00,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:00,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:05:00,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836010516] [2024-10-31 22:05:00,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:00,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:05:00,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:00,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:05:00,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:05:00,360 INFO L87 Difference]: Start difference. First operand 2466 states and 4621 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)