./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:09:37,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:09:37,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 06:09:37,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:09:37,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:09:37,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:09:37,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:09:37,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:09:37,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 06:09:37,582 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 06:09:37,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:09:37,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:09:37,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:09:37,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:09:37,586 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:09:37,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:09:37,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:09:37,587 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:09:37,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:09:37,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:09:37,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:09:37,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:09:37,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:09:37,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:09:37,593 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:09:37,594 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:09:37,594 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:09:37,594 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:09:37,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:09:37,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:09:37,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:09:37,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:09:37,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:09:37,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:09:37,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:09:37,597 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:09:37,597 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:09:37,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:09:37,597 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:09:37,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:09:37,598 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:09:37,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:09:37,599 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 -> 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 [2024-11-09 06:09:37,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:09:37,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:09:37,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:09:38,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:09:38,004 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:09:38,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i [2024-11-09 06:09:39,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:09:40,018 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:09:40,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i [2024-11-09 06:09:40,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/524ecb67e/823de1e4d52848348713a3ca9ba3677f/FLAG6bedda4d8 [2024-11-09 06:09:40,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/524ecb67e/823de1e4d52848348713a3ca9ba3677f [2024-11-09 06:09:40,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:09:40,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:09:40,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:09:40,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:09:40,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:09:40,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:09:40" (1/1) ... [2024-11-09 06:09:40,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a7e38bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:40, skipping insertion in model container [2024-11-09 06:09:40,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:09:40" (1/1) ... [2024-11-09 06:09:40,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:09:40,741 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_BER_test9-1.i[33021,33034] [2024-11-09 06:09:41,078 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_BER_test9-1.i[84583,84596] [2024-11-09 06:09:41,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:09:41,098 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:09:41,140 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_BER_test9-1.i[33021,33034] [2024-11-09 06:09:41,252 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_BER_test9-1.i[84583,84596] [2024-11-09 06:09:41,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:09:41,305 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:09:41,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:41 WrapperNode [2024-11-09 06:09:41,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:09:41,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:09:41,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:09:41,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:09:41,317 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:09:41" (1/1) ... [2024-11-09 06:09:41,360 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:09:41" (1/1) ... [2024-11-09 06:09:41,485 INFO L138 Inliner]: procedures = 177, calls = 722, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3282 [2024-11-09 06:09:41,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:09:41,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:09:41,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:09:41,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:09:41,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:41" (1/1) ... [2024-11-09 06:09:41,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:41" (1/1) ... [2024-11-09 06:09:41,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:41" (1/1) ... [2024-11-09 06:09:41,604 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-11-09 06:09:41,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:41" (1/1) ... [2024-11-09 06:09:41,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:41" (1/1) ... [2024-11-09 06:09:41,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:41" (1/1) ... [2024-11-09 06:09:41,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:41" (1/1) ... [2024-11-09 06:09:41,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:41" (1/1) ... [2024-11-09 06:09:41,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:41" (1/1) ... [2024-11-09 06:09:41,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:09:41,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:09:41,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:09:41,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:09:41,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:41" (1/1) ... [2024-11-09 06:09:41,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:09:41,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:09:41,798 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:09:41,804 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:09:41,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 06:09:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 06:09:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 06:09:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 06:09:41,859 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 06:09:41,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 06:09:41,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 06:09:41,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 06:09:41,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 06:09:41,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 06:09:41,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 06:09:41,860 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 06:09:41,860 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 06:09:41,860 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 06:09:41,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:09:41,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:09:41,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 06:09:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 06:09:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 06:09:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:09:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 06:09:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 06:09:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 06:09:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:09:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 06:09:41,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 06:09:41,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 06:09:41,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:09:41,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:09:42,101 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:09:42,104 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:09:44,987 INFO L? ?]: Removed 797 outVars from TransFormulas that were not future-live. [2024-11-09 06:09:44,987 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:09:45,037 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:09:45,038 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-09 06:09:45,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:09:45 BoogieIcfgContainer [2024-11-09 06:09:45,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:09:45,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:09:45,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:09:45,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:09:45,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:09:40" (1/3) ... [2024-11-09 06:09:45,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71620bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:09:45, skipping insertion in model container [2024-11-09 06:09:45,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:41" (2/3) ... [2024-11-09 06:09:45,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71620bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:09:45, skipping insertion in model container [2024-11-09 06:09:45,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:09:45" (3/3) ... [2024-11-09 06:09:45,049 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test9-1.i [2024-11-09 06:09:45,067 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:09:45,067 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 06:09:45,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:09:45,188 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;@2a766668, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:09:45,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 06:09:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 1371 states, 863 states have (on average 1.8389339513325609) internal successors, (1587), 1365 states have internal predecessors, (1587), 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-11-09 06:09:45,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 06:09:45,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:45,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:45,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:09:45,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:45,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1749759959, now seen corresponding path program 1 times [2024-11-09 06:09:45,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:09:45,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071027820] [2024-11-09 06:09:45,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:45,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:45,385 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:09:45,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:09:45,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071027820] [2024-11-09 06:09:45,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071027820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:45,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:45,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:09:45,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363657430] [2024-11-09 06:09:45,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:45,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 06:09:45,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:09:45,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 06:09:45,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:09:45,425 INFO L87 Difference]: Start difference. First operand has 1371 states, 863 states have (on average 1.8389339513325609) internal successors, (1587), 1365 states have internal predecessors, (1587), 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-11-09 06:09:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:45,633 INFO L93 Difference]: Finished difference Result 2740 states and 5684 transitions. [2024-11-09 06:09:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 06:09:45,636 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:09:45,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:45,686 INFO L225 Difference]: With dead ends: 2740 [2024-11-09 06:09:45,687 INFO L226 Difference]: Without dead ends: 1367 [2024-11-09 06:09:45,707 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:09:45,713 INFO L432 NwaCegarLoop]: 2533 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, 2533 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:09:45,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:09:45,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2024-11-09 06:09:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1367. [2024-11-09 06:09:46,106 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-11-09 06:09:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 2529 transitions. [2024-11-09 06:09:46,124 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 2529 transitions. Word has length 9 [2024-11-09 06:09:46,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:46,124 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 2529 transitions. [2024-11-09 06:09:46,125 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:09:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2529 transitions. [2024-11-09 06:09:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 06:09:46,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:46,132 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:09:46,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:09:46,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:09:46,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:46,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2144823555, now seen corresponding path program 1 times [2024-11-09 06:09:46,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:09:46,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962764894] [2024-11-09 06:09:46,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:46,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:46,679 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:09:46,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:09:46,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962764894] [2024-11-09 06:09:46,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962764894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:46,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:46,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:09:46,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488522288] [2024-11-09 06:09:46,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:46,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:09:46,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:09:46,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:09:46,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:09:46,683 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-11-09 06:09:47,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:47,874 INFO L93 Difference]: Finished difference Result 3887 states and 7286 transitions. [2024-11-09 06:09:47,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:09:47,875 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:09:47,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:47,905 INFO L225 Difference]: With dead ends: 3887 [2024-11-09 06:09:47,906 INFO L226 Difference]: Without dead ends: 2721 [2024-11-09 06:09:47,919 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:09:47,921 INFO L432 NwaCegarLoop]: 2755 mSDtfsCounter, 1508 mSDsluCounter, 4759 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 7514 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:47,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 7514 Invalid, 562 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 06:09:47,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2024-11-09 06:09:48,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 1369. [2024-11-09 06:09:48,646 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-11-09 06:09:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2531 transitions. [2024-11-09 06:09:48,673 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2531 transitions. Word has length 64 [2024-11-09 06:09:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:48,674 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2531 transitions. [2024-11-09 06:09:48,674 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:09:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2531 transitions. [2024-11-09 06:09:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 06:09:48,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:48,691 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:09:48,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:09:48,692 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:09:48,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:48,692 INFO L85 PathProgramCache]: Analyzing trace with hash 799809380, now seen corresponding path program 1 times [2024-11-09 06:09:48,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:09:48,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938766322] [2024-11-09 06:09:48,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:48,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:49,130 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:09:49,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:09:49,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938766322] [2024-11-09 06:09:49,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938766322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:49,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:49,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:09:49,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175555598] [2024-11-09 06:09:49,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:49,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:09:49,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:09:49,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:09:49,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:09:49,136 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-11-09 06:09:49,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:49,280 INFO L93 Difference]: Finished difference Result 2692 states and 4992 transitions. [2024-11-09 06:09:49,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:09:49,281 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:09:49,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:49,298 INFO L225 Difference]: With dead ends: 2692 [2024-11-09 06:09:49,298 INFO L226 Difference]: Without dead ends: 1327 [2024-11-09 06:09:49,307 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:09:49,310 INFO L432 NwaCegarLoop]: 2427 mSDtfsCounter, 30 mSDsluCounter, 4835 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-11-09 06:09:49,311 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-11-09 06:09:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2024-11-09 06:09:49,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1327. [2024-11-09 06:09:49,489 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-11-09 06:09:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 2454 transitions. [2024-11-09 06:09:49,501 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 2454 transitions. Word has length 140 [2024-11-09 06:09:49,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:49,502 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 2454 transitions. [2024-11-09 06:09:49,502 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:09:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 2454 transitions. [2024-11-09 06:09:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 06:09:49,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:49,509 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:09:49,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:09:49,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:09:49,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:49,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1221636368, now seen corresponding path program 1 times [2024-11-09 06:09:49,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:09:49,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237464248] [2024-11-09 06:09:49,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:49,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:49,740 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:09:49,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:09:49,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237464248] [2024-11-09 06:09:49,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237464248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:49,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:49,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:09:49,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236135458] [2024-11-09 06:09:49,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:49,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:09:49,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:09:49,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:09:49,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:09:49,742 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-11-09 06:09:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:49,921 INFO L93 Difference]: Finished difference Result 3875 states and 7228 transitions. [2024-11-09 06:09:49,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:09:49,925 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:09:49,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:49,949 INFO L225 Difference]: With dead ends: 3875 [2024-11-09 06:09:49,950 INFO L226 Difference]: Without dead ends: 2552 [2024-11-09 06:09:49,959 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:09:49,961 INFO L432 NwaCegarLoop]: 2900 mSDtfsCounter, 1261 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 5332 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:49,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 5332 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:09:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2024-11-09 06:09:50,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2550. [2024-11-09 06:09:50,373 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-11-09 06:09:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 4775 transitions. [2024-11-09 06:09:50,394 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 4775 transitions. Word has length 140 [2024-11-09 06:09:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:50,395 INFO L471 AbstractCegarLoop]: Abstraction has 2550 states and 4775 transitions. [2024-11-09 06:09:50,395 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:09:50,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 4775 transitions. [2024-11-09 06:09:50,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 06:09:50,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:50,398 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:09:50,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:09:50,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:09:50,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:50,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2036857608, now seen corresponding path program 1 times [2024-11-09 06:09:50,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:09:50,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506876137] [2024-11-09 06:09:50,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:50,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:50,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:09:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:09:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:50,851 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:09:50,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:09:50,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506876137] [2024-11-09 06:09:50,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506876137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:50,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:50,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:09:50,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469931009] [2024-11-09 06:09:50,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:50,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:09:50,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:09:50,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:09:50,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:09:50,856 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-11-09 06:09:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:53,792 INFO L93 Difference]: Finished difference Result 4770 states and 9091 transitions. [2024-11-09 06:09:53,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:09:53,793 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:09:53,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:53,829 INFO L225 Difference]: With dead ends: 4770 [2024-11-09 06:09:53,830 INFO L226 Difference]: Without dead ends: 2469 [2024-11-09 06:09:53,845 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:09:53,846 INFO L432 NwaCegarLoop]: 2338 mSDtfsCounter, 38 mSDsluCounter, 4941 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:53,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 7279 Invalid, 2160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-09 06:09:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2024-11-09 06:09:54,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2466. [2024-11-09 06:09:54,214 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-11-09 06:09:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 4621 transitions. [2024-11-09 06:09:54,240 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 4621 transitions. Word has length 155 [2024-11-09 06:09:54,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:54,244 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 4621 transitions. [2024-11-09 06:09:54,245 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:09:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 4621 transitions. [2024-11-09 06:09:54,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 06:09:54,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:54,253 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:09:54,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:09:54,253 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:09:54,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:54,254 INFO L85 PathProgramCache]: Analyzing trace with hash 865343484, now seen corresponding path program 1 times [2024-11-09 06:09:54,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:09:54,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738030582] [2024-11-09 06:09:54,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:54,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:54,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:09:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:54,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:09:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:54,614 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:09:54,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:09:54,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738030582] [2024-11-09 06:09:54,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738030582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:54,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:54,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:09:54,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056032909] [2024-11-09 06:09:54,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:54,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:09:54,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:09:54,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:09:54,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:09:54,618 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) [2024-11-09 06:09:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:59,992 INFO L93 Difference]: Finished difference Result 4923 states and 9233 transitions. [2024-11-09 06:09:59,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:09:59,993 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:09:59,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:10:00,025 INFO L225 Difference]: With dead ends: 4923 [2024-11-09 06:10:00,025 INFO L226 Difference]: Without dead ends: 2548 [2024-11-09 06:10:00,039 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:10:00,040 INFO L432 NwaCegarLoop]: 2670 mSDtfsCounter, 6140 mSDsluCounter, 3836 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 2527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6642 SdHoareTripleChecker+Valid, 6506 SdHoareTripleChecker+Invalid, 3935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2527 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:10:00,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6642 Valid, 6506 Invalid, 3935 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2527 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-09 06:10:00,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2024-11-09 06:10:00,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 1372. [2024-11-09 06:10:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 865 states have (on average 1.7190751445086705) internal successors, (1487), 1366 states have internal predecessors, (1487), 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-11-09 06:10:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2493 transitions. [2024-11-09 06:10:00,385 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2493 transitions. Word has length 155 [2024-11-09 06:10:00,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:10:00,386 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 2493 transitions. [2024-11-09 06:10:00,386 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:10:00,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2493 transitions. [2024-11-09 06:10:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 06:10:00,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:10:00,389 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:10:00,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:10:00,389 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:10:00,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:10:00,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1967797584, now seen corresponding path program 1 times [2024-11-09 06:10:00,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:10:00,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797001956] [2024-11-09 06:10:00,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:10:00,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:10:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:10:01,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:10:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:10:01,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:10:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:10:01,310 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:10:01,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:10:01,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797001956] [2024-11-09 06:10:01,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797001956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:10:01,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440859250] [2024-11-09 06:10:01,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:10:01,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:10:01,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:10:01,314 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:10:01,315 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:10:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:10:01,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 06:10:01,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:10:01,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:10:01,996 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 19 treesize of output 11 [2024-11-09 06:10:02,019 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:10:02,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:10:02,251 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:10:02,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440859250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:10:02,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:10:02,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 13 [2024-11-09 06:10:02,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017891463] [2024-11-09 06:10:02,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:10:02,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:10:02,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:10:02,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:10:02,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:10:02,257 INFO L87 Difference]: Start difference. First operand 1372 states and 2493 transitions. Second operand has 13 states, 13 states have (on average 25.23076923076923) internal successors, (328), 12 states have internal predecessors, (328), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 06:10:12,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:10:12,876 INFO L93 Difference]: Finished difference Result 5231 states and 9642 transitions. [2024-11-09 06:10:12,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:10:12,877 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 25.23076923076923) internal successors, (328), 12 states have internal predecessors, (328), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 165 [2024-11-09 06:10:12,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:10:12,910 INFO L225 Difference]: With dead ends: 5231 [2024-11-09 06:10:12,910 INFO L226 Difference]: Without dead ends: 4107 [2024-11-09 06:10:12,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 326 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-09 06:10:12,918 INFO L432 NwaCegarLoop]: 2022 mSDtfsCounter, 8088 mSDsluCounter, 11202 mSDsCounter, 0 mSdLazyCounter, 6219 mSolverCounterSat, 4020 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9096 SdHoareTripleChecker+Valid, 13224 SdHoareTripleChecker+Invalid, 10239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4020 IncrementalHoareTripleChecker+Valid, 6219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:10:12,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9096 Valid, 13224 Invalid, 10239 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4020 Valid, 6219 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2024-11-09 06:10:12,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2024-11-09 06:10:13,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 1719. [2024-11-09 06:10:13,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1719 states, 1208 states have (on average 1.609271523178808) internal successors, (1944), 1709 states have internal predecessors, (1944), 506 states have call successors, (506), 3 states have call predecessors, (506), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2024-11-09 06:10:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2956 transitions. [2024-11-09 06:10:13,460 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2956 transitions. Word has length 165 [2024-11-09 06:10:13,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:10:13,462 INFO L471 AbstractCegarLoop]: Abstraction has 1719 states and 2956 transitions. [2024-11-09 06:10:13,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.23076923076923) internal successors, (328), 12 states have internal predecessors, (328), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 06:10:13,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2956 transitions. [2024-11-09 06:10:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-09 06:10:13,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:10:13,469 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:10:13,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 06:10:13,673 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:10:13,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:10:13,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:10:13,675 INFO L85 PathProgramCache]: Analyzing trace with hash -386748745, now seen corresponding path program 1 times [2024-11-09 06:10:13,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:10:13,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795948839] [2024-11-09 06:10:13,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:10:13,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:10:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:10:17,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:10:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:10:17,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:10:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:10:17,981 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:10:17,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:10:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795948839] [2024-11-09 06:10:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795948839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:10:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559960746] [2024-11-09 06:10:17,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:10:17,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:10:17,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:10:17,987 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:10:17,989 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:10:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:10:18,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 06:10:18,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:10:18,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:10:19,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 06:10:19,143 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 19 treesize of output 11 [2024-11-09 06:10:19,258 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 19 treesize of output 11 [2024-11-09 06:10:19,376 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 19 treesize of output 11 [2024-11-09 06:10:19,398 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:10:19,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:10:19,935 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:10:19,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559960746] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:10:19,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:10:19,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 25 [2024-11-09 06:10:19,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826742777] [2024-11-09 06:10:19,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:10:19,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 06:10:19,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:10:19,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 06:10:19,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2024-11-09 06:10:19,944 INFO L87 Difference]: Start difference. First operand 1719 states and 2956 transitions. Second operand has 25 states, 25 states have (on average 40.48) internal successors, (1012), 24 states have internal predecessors, (1012), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 06:10:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:10:50,549 INFO L93 Difference]: Finished difference Result 10563 states and 19433 transitions. [2024-11-09 06:10:50,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 06:10:50,550 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 40.48) internal successors, (1012), 24 states have internal predecessors, (1012), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 393 [2024-11-09 06:10:50,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:10:50,648 INFO L225 Difference]: With dead ends: 10563 [2024-11-09 06:10:50,652 INFO L226 Difference]: Without dead ends: 9439 [2024-11-09 06:10:50,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 815 GetRequests, 779 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=866, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 06:10:50,664 INFO L432 NwaCegarLoop]: 6857 mSDtfsCounter, 14588 mSDsluCounter, 46210 mSDsCounter, 0 mSdLazyCounter, 28341 mSolverCounterSat, 6292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17608 SdHoareTripleChecker+Valid, 53067 SdHoareTripleChecker+Invalid, 34633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 6292 IncrementalHoareTripleChecker+Valid, 28341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:10:50,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17608 Valid, 53067 Invalid, 34633 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [6292 Valid, 28341 Invalid, 0 Unknown, 0 Unchecked, 28.6s Time] [2024-11-09 06:10:50,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9439 states. [2024-11-09 06:10:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9439 to 2583. [2024-11-09 06:10:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2583 states, 2066 states have (on average 1.4956437560503388) internal successors, (3090), 2567 states have internal predecessors, (3090), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2024-11-09 06:10:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 4114 transitions. [2024-11-09 06:10:52,063 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 4114 transitions. Word has length 393 [2024-11-09 06:10:52,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:10:52,064 INFO L471 AbstractCegarLoop]: Abstraction has 2583 states and 4114 transitions. [2024-11-09 06:10:52,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 40.48) internal successors, (1012), 24 states have internal predecessors, (1012), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 06:10:52,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 4114 transitions. [2024-11-09 06:10:52,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-11-09 06:10:52,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:10:52,109 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:10:52,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:10:52,310 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:10:52,310 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:10:52,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:10:52,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1177753669, now seen corresponding path program 2 times [2024-11-09 06:10:52,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:10:52,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951389635] [2024-11-09 06:10:52,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:10:52,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms