./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.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_SFH_test5-3.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 94599b38b669e42115f92cee257d9ed4ed5d4777dca7d2ee690bacb4e0d226f0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:25:09,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:25:09,759 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 06:25:09,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:25:09,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:25:09,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:25:09,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:25:09,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:25:09,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 06:25:09,793 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 06:25:09,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:25:09,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:25:09,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:25:09,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:25:09,796 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:25:09,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:25:09,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:25:09,797 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:25:09,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:25:09,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:25:09,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:25:09,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:25:09,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:25:09,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:25:09,803 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:25:09,803 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:25:09,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:25:09,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:25:09,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:25:09,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:25:09,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:25:09,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:25:09,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:25:09,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:25:09,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:25:09,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:25:09,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:25:09,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:25:09,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:25:09,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:25:09,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:25:09,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:25:09,808 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 -> 94599b38b669e42115f92cee257d9ed4ed5d4777dca7d2ee690bacb4e0d226f0 [2024-11-09 06:25:10,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:25:10,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:25:10,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:25:10,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:25:10,083 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:25:10,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i [2024-11-09 06:25:11,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:25:11,904 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:25:11,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i [2024-11-09 06:25:11,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3208f38ad/7797f808a49241efa1a41ce8381b932b/FLAG005c4c2f6 [2024-11-09 06:25:12,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3208f38ad/7797f808a49241efa1a41ce8381b932b [2024-11-09 06:25:12,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:25:12,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:25:12,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:25:12,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:25:12,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:25:12,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:25:12" (1/1) ... [2024-11-09 06:25:12,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47dca321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:12, skipping insertion in model container [2024-11-09 06:25:12,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:25:12" (1/1) ... [2024-11-09 06:25:12,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:25:12,669 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_SFH_test5-3.i[33021,33034] [2024-11-09 06:25:12,831 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_SFH_test5-3.i[49681,49694] [2024-11-09 06:25:12,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:25:12,863 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:25:12,900 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_SFH_test5-3.i[33021,33034] [2024-11-09 06:25:12,963 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_SFH_test5-3.i[49681,49694] [2024-11-09 06:25:12,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:25:13,014 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:25:13,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:13 WrapperNode [2024-11-09 06:25:13,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:25:13,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:25:13,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:25:13,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:25:13,024 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:25:13" (1/1) ... [2024-11-09 06:25:13,065 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:25:13" (1/1) ... [2024-11-09 06:25:13,178 INFO L138 Inliner]: procedures = 177, calls = 472, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2351 [2024-11-09 06:25:13,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:25:13,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:25:13,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:25:13,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:25:13,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:13" (1/1) ... [2024-11-09 06:25:13,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:13" (1/1) ... [2024-11-09 06:25:13,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:13" (1/1) ... [2024-11-09 06:25:13,385 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [2, 417, 24]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 99 writes are split as follows [0, 98, 1]. [2024-11-09 06:25:13,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:13" (1/1) ... [2024-11-09 06:25:13,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:13" (1/1) ... [2024-11-09 06:25:13,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:13" (1/1) ... [2024-11-09 06:25:13,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:13" (1/1) ... [2024-11-09 06:25:13,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:13" (1/1) ... [2024-11-09 06:25:13,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:13" (1/1) ... [2024-11-09 06:25:13,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:25:13,520 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:25:13,521 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:25:13,521 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:25:13,522 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:13" (1/1) ... [2024-11-09 06:25:13,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:25:13,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:25:13,603 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:25:13,608 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:25:13,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 06:25:13,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 06:25:13,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 06:25:13,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 06:25:13,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 06:25:13,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 06:25:13,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 06:25:13,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 06:25:13,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 06:25:13,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 06:25:13,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 06:25:13,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 06:25:13,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 06:25:13,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 06:25:13,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:25:13,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:25:13,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 06:25:13,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 06:25:13,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 06:25:13,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:25:13,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 06:25:13,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 06:25:13,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 06:25:13,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:25:13,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 06:25:13,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 06:25:13,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 06:25:13,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:25:13,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:25:13,907 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:25:13,909 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:25:16,064 INFO L? ?]: Removed 526 outVars from TransFormulas that were not future-live. [2024-11-09 06:25:16,064 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:25:16,105 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:25:16,105 INFO L316 CfgBuilder]: Removed 100 assume(true) statements. [2024-11-09 06:25:16,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:25:16 BoogieIcfgContainer [2024-11-09 06:25:16,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:25:16,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:25:16,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:25:16,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:25:16,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:25:12" (1/3) ... [2024-11-09 06:25:16,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4802d2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:25:16, skipping insertion in model container [2024-11-09 06:25:16,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:13" (2/3) ... [2024-11-09 06:25:16,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4802d2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:25:16, skipping insertion in model container [2024-11-09 06:25:16,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:25:16" (3/3) ... [2024-11-09 06:25:16,118 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-3.i [2024-11-09 06:25:16,137 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:25:16,137 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 06:25:16,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:25:16,232 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;@7786d968, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:25:16,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 06:25:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 631 states, 615 states have (on average 1.6260162601626016) internal successors, (1000), 622 states have internal predecessors, (1000), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 06:25:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 06:25:16,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:16,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:25:16,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:16,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:16,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1010421804, now seen corresponding path program 1 times [2024-11-09 06:25:16,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:25:16,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641118463] [2024-11-09 06:25:16,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:16,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:25:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:16,442 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:25:16,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:25:16,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641118463] [2024-11-09 06:25:16,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641118463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:25:16,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:25:16,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:25:16,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890137228] [2024-11-09 06:25:16,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:25:16,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 06:25:16,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:25:16,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 06:25:16,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:25:16,485 INFO L87 Difference]: Start difference. First operand has 631 states, 615 states have (on average 1.6260162601626016) internal successors, (1000), 622 states have internal predecessors, (1000), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:25:16,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:16,569 INFO L93 Difference]: Finished difference Result 1260 states and 2047 transitions. [2024-11-09 06:25:16,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 06:25:16,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 06:25:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:16,592 INFO L225 Difference]: With dead ends: 1260 [2024-11-09 06:25:16,592 INFO L226 Difference]: Without dead ends: 565 [2024-11-09 06:25:16,605 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:25:16,610 INFO L432 NwaCegarLoop]: 913 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, 913 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:25:16,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:25:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-09 06:25:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2024-11-09 06:25:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 550 states have (on average 1.4581818181818182) internal successors, (802), 556 states have internal predecessors, (802), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 06:25:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 824 transitions. [2024-11-09 06:25:16,684 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 824 transitions. Word has length 8 [2024-11-09 06:25:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:16,685 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 824 transitions. [2024-11-09 06:25:16,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:25:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 824 transitions. [2024-11-09 06:25:16,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 06:25:16,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:16,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:25:16,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:25:16,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:16,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:16,690 INFO L85 PathProgramCache]: Analyzing trace with hash 76912623, now seen corresponding path program 1 times [2024-11-09 06:25:16,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:25:16,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589974232] [2024-11-09 06:25:16,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:16,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:25:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:16,982 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:25:16,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:25:16,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589974232] [2024-11-09 06:25:16,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589974232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:25:16,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:25:16,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:25:16,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299706879] [2024-11-09 06:25:16,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:25:16,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:25:16,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:25:16,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:25:16,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:25:16,990 INFO L87 Difference]: Start difference. First operand 565 states and 824 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:25:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:17,067 INFO L93 Difference]: Finished difference Result 1292 states and 1895 transitions. [2024-11-09 06:25:17,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:25:17,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-09 06:25:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:17,075 INFO L225 Difference]: With dead ends: 1292 [2024-11-09 06:25:17,076 INFO L226 Difference]: Without dead ends: 1117 [2024-11-09 06:25:17,077 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:25:17,079 INFO L432 NwaCegarLoop]: 864 mSDtfsCounter, 787 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:17,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1680 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:25:17,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2024-11-09 06:25:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 566. [2024-11-09 06:25:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 551 states have (on average 1.4573502722323048) internal successors, (803), 557 states have internal predecessors, (803), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 06:25:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 825 transitions. [2024-11-09 06:25:17,109 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 825 transitions. Word has length 62 [2024-11-09 06:25:17,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:17,112 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 825 transitions. [2024-11-09 06:25:17,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:25:17,112 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 825 transitions. [2024-11-09 06:25:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-09 06:25:17,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:17,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:25:17,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:25:17,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:17,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:17,131 INFO L85 PathProgramCache]: Analyzing trace with hash 41978054, now seen corresponding path program 1 times [2024-11-09 06:25:17,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:25:17,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915038798] [2024-11-09 06:25:17,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:17,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:25:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:25:17,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:25:17,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915038798] [2024-11-09 06:25:17,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915038798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:25:17,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:25:17,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:25:17,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377682710] [2024-11-09 06:25:17,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:25:17,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:25:17,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:25:17,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:25:17,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:25:17,814 INFO L87 Difference]: Start difference. First operand 566 states and 825 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:25:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:17,921 INFO L93 Difference]: Finished difference Result 1132 states and 1650 transitions. [2024-11-09 06:25:17,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:25:17,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2024-11-09 06:25:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:17,927 INFO L225 Difference]: With dead ends: 1132 [2024-11-09 06:25:17,927 INFO L226 Difference]: Without dead ends: 569 [2024-11-09 06:25:17,929 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:25:17,930 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 105 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2295 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:17,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2295 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:25:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-09 06:25:17,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2024-11-09 06:25:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 551 states have (on average 1.4446460980036298) internal successors, (796), 557 states have internal predecessors, (796), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 06:25:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 818 transitions. [2024-11-09 06:25:17,955 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 818 transitions. Word has length 208 [2024-11-09 06:25:17,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:17,957 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 818 transitions. [2024-11-09 06:25:17,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:25:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 818 transitions. [2024-11-09 06:25:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-09 06:25:17,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:17,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:25:17,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:25:17,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:17,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:17,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1497571398, now seen corresponding path program 1 times [2024-11-09 06:25:17,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:25:17,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040704812] [2024-11-09 06:25:17,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:17,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:25:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:18,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:25:18,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:25:18,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040704812] [2024-11-09 06:25:18,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040704812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:25:18,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:25:18,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:25:18,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328821366] [2024-11-09 06:25:18,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:25:18,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:25:18,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:25:18,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:25:18,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:25:18,345 INFO L87 Difference]: Start difference. First operand 566 states and 818 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:25:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:18,407 INFO L93 Difference]: Finished difference Result 1258 states and 1822 transitions. [2024-11-09 06:25:18,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:25:18,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2024-11-09 06:25:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:18,414 INFO L225 Difference]: With dead ends: 1258 [2024-11-09 06:25:18,415 INFO L226 Difference]: Without dead ends: 695 [2024-11-09 06:25:18,417 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:25:18,419 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 134 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:18,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1625 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:25:18,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-11-09 06:25:18,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2024-11-09 06:25:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 680 states have (on average 1.4470588235294117) internal successors, (984), 686 states have internal predecessors, (984), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 06:25:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1006 transitions. [2024-11-09 06:25:18,442 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1006 transitions. Word has length 208 [2024-11-09 06:25:18,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:18,443 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 1006 transitions. [2024-11-09 06:25:18,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:25:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1006 transitions. [2024-11-09 06:25:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-09 06:25:18,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:18,447 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:25:18,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:25:18,447 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:18,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:18,448 INFO L85 PathProgramCache]: Analyzing trace with hash -398690799, now seen corresponding path program 1 times [2024-11-09 06:25:18,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:25:18,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354352106] [2024-11-09 06:25:18,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:18,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:25:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:19,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 06:25:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:19,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 06:25:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:25:19,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:25:19,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354352106] [2024-11-09 06:25:19,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354352106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:25:19,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:25:19,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:25:19,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949401588] [2024-11-09 06:25:19,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:25:19,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:25:19,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:25:19,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:25:19,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:25:19,113 INFO L87 Difference]: Start difference. First operand 695 states and 1006 transitions. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:25:19,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:19,639 INFO L93 Difference]: Finished difference Result 1219 states and 1764 transitions. [2024-11-09 06:25:19,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:25:19,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 223 [2024-11-09 06:25:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:19,645 INFO L225 Difference]: With dead ends: 1219 [2024-11-09 06:25:19,645 INFO L226 Difference]: Without dead ends: 656 [2024-11-09 06:25:19,647 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:25:19,648 INFO L432 NwaCegarLoop]: 709 mSDtfsCounter, 38 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2699 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:19,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 2699 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:25:19,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-11-09 06:25:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 653. [2024-11-09 06:25:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 638 states have (on average 1.421630094043887) internal successors, (907), 644 states have internal predecessors, (907), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 06:25:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 929 transitions. [2024-11-09 06:25:19,676 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 929 transitions. Word has length 223 [2024-11-09 06:25:19,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:19,677 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 929 transitions. [2024-11-09 06:25:19,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:25:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 929 transitions. [2024-11-09 06:25:19,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-09 06:25:19,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:19,683 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:25:19,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:25:19,686 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:19,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:19,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1100880029, now seen corresponding path program 1 times [2024-11-09 06:25:19,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:25:19,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697105137] [2024-11-09 06:25:19,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:19,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:25:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:20,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 06:25:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:20,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 06:25:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:20,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:25:20,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:25:20,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697105137] [2024-11-09 06:25:20,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697105137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:25:20,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:25:20,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:25:20,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691128185] [2024-11-09 06:25:20,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:25:20,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:25:20,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:25:20,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:25:20,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:25:20,126 INFO L87 Difference]: Start difference. First operand 653 states and 929 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:25:20,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:20,541 INFO L93 Difference]: Finished difference Result 1470 states and 2101 transitions. [2024-11-09 06:25:20,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:25:20,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 223 [2024-11-09 06:25:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:20,548 INFO L225 Difference]: With dead ends: 1470 [2024-11-09 06:25:20,548 INFO L226 Difference]: Without dead ends: 949 [2024-11-09 06:25:20,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:25:20,550 INFO L432 NwaCegarLoop]: 921 mSDtfsCounter, 463 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 2443 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:20,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 2443 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:25:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-11-09 06:25:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 944. [2024-11-09 06:25:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 921 states have (on average 1.4223669923995657) internal successors, (1310), 932 states have internal predecessors, (1310), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 06:25:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1348 transitions. [2024-11-09 06:25:20,579 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1348 transitions. Word has length 223 [2024-11-09 06:25:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:20,580 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1348 transitions. [2024-11-09 06:25:20,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:25:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1348 transitions. [2024-11-09 06:25:20,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 06:25:20,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:20,584 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:25:20,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:25:20,585 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:20,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:20,585 INFO L85 PathProgramCache]: Analyzing trace with hash -13530464, now seen corresponding path program 1 times [2024-11-09 06:25:20,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:25:20,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872569265] [2024-11-09 06:25:20,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:20,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:25:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:21,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 06:25:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:21,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 06:25:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:21,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 06:25:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:21,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-09 06:25:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:25:21,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:25:21,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872569265] [2024-11-09 06:25:21,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872569265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:25:21,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501367733] [2024-11-09 06:25:21,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:21,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:25:21,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:25:21,207 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:25:21,210 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:25:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:21,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 1194 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:25:21,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:25:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 06:25:21,861 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:25:21,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501367733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:25:21,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:25:21,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 06:25:21,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930159355] [2024-11-09 06:25:21,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:25:21,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:25:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:25:21,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:25:21,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:25:21,865 INFO L87 Difference]: Start difference. First operand 944 states and 1348 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:25:21,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:21,965 INFO L93 Difference]: Finished difference Result 1303 states and 1888 transitions. [2024-11-09 06:25:21,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:25:21,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 238 [2024-11-09 06:25:21,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:21,973 INFO L225 Difference]: With dead ends: 1303 [2024-11-09 06:25:21,973 INFO L226 Difference]: Without dead ends: 984 [2024-11-09 06:25:21,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:25:21,975 INFO L432 NwaCegarLoop]: 714 mSDtfsCounter, 8 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:21,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1413 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:25:21,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-11-09 06:25:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2024-11-09 06:25:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 961 states have (on average 1.4047866805411031) internal successors, (1350), 972 states have internal predecessors, (1350), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 06:25:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1388 transitions. [2024-11-09 06:25:22,009 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1388 transitions. Word has length 238 [2024-11-09 06:25:22,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:22,009 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1388 transitions. [2024-11-09 06:25:22,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:25:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1388 transitions. [2024-11-09 06:25:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 06:25:22,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:22,014 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:25:22,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:25:22,214 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:25:22,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:22,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:22,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1358276834, now seen corresponding path program 1 times [2024-11-09 06:25:22,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:25:22,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116234255] [2024-11-09 06:25:22,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:22,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:25:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:22,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 06:25:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:22,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 06:25:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:22,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 06:25:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:22,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-09 06:25:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:25:22,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:25:22,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116234255] [2024-11-09 06:25:22,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116234255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:25:22,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021434409] [2024-11-09 06:25:22,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:22,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:25:22,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:25:22,766 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:25:22,768 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:25:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:23,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:25:23,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:25:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 06:25:23,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:25:23,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021434409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:25:23,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:25:23,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-09 06:25:23,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849680134] [2024-11-09 06:25:23,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:25:23,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:25:23,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:25:23,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:25:23,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:25:23,409 INFO L87 Difference]: Start difference. First operand 984 states and 1388 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:25:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:23,495 INFO L93 Difference]: Finished difference Result 1315 states and 1880 transitions. [2024-11-09 06:25:23,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:25:23,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 238 [2024-11-09 06:25:23,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:23,502 INFO L225 Difference]: With dead ends: 1315 [2024-11-09 06:25:23,502 INFO L226 Difference]: Without dead ends: 956 [2024-11-09 06:25:23,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:25:23,504 INFO L432 NwaCegarLoop]: 706 mSDtfsCounter, 105 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2025 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:23,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2025 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:25:23,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-11-09 06:25:23,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 956. [2024-11-09 06:25:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 933 states have (on average 1.4019292604501608) internal successors, (1308), 944 states have internal predecessors, (1308), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 06:25:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1346 transitions. [2024-11-09 06:25:23,571 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1346 transitions. Word has length 238 [2024-11-09 06:25:23,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:23,571 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1346 transitions. [2024-11-09 06:25:23,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:25:23,572 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1346 transitions. [2024-11-09 06:25:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 06:25:23,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:23,576 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:25:23,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:25:23,776 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:25:23,777 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:23,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1185044588, now seen corresponding path program 1 times [2024-11-09 06:25:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:25:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938924619] [2024-11-09 06:25:23,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:23,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:25:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:24,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 06:25:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:24,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 06:25:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:24,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 06:25:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:24,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-09 06:25:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:24,272 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:25:24,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:25:24,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938924619] [2024-11-09 06:25:24,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938924619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:25:24,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250920210] [2024-11-09 06:25:24,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:24,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:25:24,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:25:24,275 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:25:24,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:25:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:24,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:25:24,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:25:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:25:25,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:25:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:25:25,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250920210] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:25:25,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:25:25,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-09 06:25:25,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465135408] [2024-11-09 06:25:25,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:25:25,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:25:25,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:25:25,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:25:25,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:25:25,470 INFO L87 Difference]: Start difference. First operand 956 states and 1346 transitions. Second operand has 8 states, 8 states have (on average 67.125) internal successors, (537), 7 states have internal predecessors, (537), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 06:25:26,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:26,054 INFO L93 Difference]: Finished difference Result 2554 states and 3639 transitions. [2024-11-09 06:25:26,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:25:26,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 67.125) internal successors, (537), 7 states have internal predecessors, (537), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 238 [2024-11-09 06:25:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:26,066 INFO L225 Difference]: With dead ends: 2554 [2024-11-09 06:25:26,066 INFO L226 Difference]: Without dead ends: 2222 [2024-11-09 06:25:26,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:25:26,068 INFO L432 NwaCegarLoop]: 718 mSDtfsCounter, 3196 mSDsluCounter, 3006 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3243 SdHoareTripleChecker+Valid, 3724 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:26,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3243 Valid, 3724 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:25:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2024-11-09 06:25:26,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 1703. [2024-11-09 06:25:26,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1665 states have (on average 1.3867867867867867) internal successors, (2309), 1676 states have internal predecessors, (2309), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 26 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 06:25:26,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2377 transitions. [2024-11-09 06:25:26,129 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2377 transitions. Word has length 238 [2024-11-09 06:25:26,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:26,130 INFO L471 AbstractCegarLoop]: Abstraction has 1703 states and 2377 transitions. [2024-11-09 06:25:26,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 67.125) internal successors, (537), 7 states have internal predecessors, (537), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 06:25:26,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2377 transitions. [2024-11-09 06:25:26,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2024-11-09 06:25:26,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:26,147 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:25:26,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 06:25:26,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:25:26,349 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:26,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:26,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1088483481, now seen corresponding path program 1 times [2024-11-09 06:25:26,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:25:26,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773967680] [2024-11-09 06:25:26,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:26,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:25:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:28,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 06:25:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:28,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 06:25:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:28,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 06:25:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:28,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-09 06:25:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:28,132 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 4 proven. 534 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2024-11-09 06:25:28,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:25:28,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773967680] [2024-11-09 06:25:28,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773967680] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:25:28,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066082858] [2024-11-09 06:25:28,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:28,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:25:28,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:25:28,136 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:25:28,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:25:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:29,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 3219 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 06:25:29,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:25:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:25:30,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:25:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:25:30,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066082858] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:25:30,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:25:30,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-11-09 06:25:30,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207775242] [2024-11-09 06:25:30,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:25:30,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 06:25:30,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:25:30,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 06:25:30,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2024-11-09 06:25:30,994 INFO L87 Difference]: Start difference. First operand 1703 states and 2377 transitions. Second operand has 17 states, 17 states have (on average 98.17647058823529) internal successors, (1669), 16 states have internal predecessors, (1669), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-09 06:25:40,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:40,384 INFO L93 Difference]: Finished difference Result 16930 states and 24075 transitions. [2024-11-09 06:25:40,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-09 06:25:40,385 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 98.17647058823529) internal successors, (1669), 16 states have internal predecessors, (1669), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 676 [2024-11-09 06:25:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:40,459 INFO L225 Difference]: With dead ends: 16930 [2024-11-09 06:25:40,459 INFO L226 Difference]: Without dead ends: 15847 [2024-11-09 06:25:40,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1418 GetRequests, 1349 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1242, Invalid=3728, Unknown=0, NotChecked=0, Total=4970 [2024-11-09 06:25:40,471 INFO L432 NwaCegarLoop]: 1707 mSDtfsCounter, 37145 mSDsluCounter, 17004 mSDsCounter, 0 mSdLazyCounter, 2965 mSolverCounterSat, 588 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37145 SdHoareTripleChecker+Valid, 18711 SdHoareTripleChecker+Invalid, 3553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 588 IncrementalHoareTripleChecker+Valid, 2965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:40,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37145 Valid, 18711 Invalid, 3553 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [588 Valid, 2965 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-11-09 06:25:40,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15847 states. [2024-11-09 06:25:40,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15847 to 9399. [2024-11-09 06:25:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9399 states, 9269 states have (on average 1.3837522925881973) internal successors, (12826), 9285 states have internal predecessors, (12826), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 114 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-09 06:25:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9399 states to 9399 states and 13078 transitions. [2024-11-09 06:25:40,851 INFO L78 Accepts]: Start accepts. Automaton has 9399 states and 13078 transitions. Word has length 676 [2024-11-09 06:25:40,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:40,852 INFO L471 AbstractCegarLoop]: Abstraction has 9399 states and 13078 transitions. [2024-11-09 06:25:40,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 98.17647058823529) internal successors, (1669), 16 states have internal predecessors, (1669), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-09 06:25:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 9399 states and 13078 transitions. [2024-11-09 06:25:40,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1563 [2024-11-09 06:25:40,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:40,993 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:25:41,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 06:25:41,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:25:41,195 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:41,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:41,196 INFO L85 PathProgramCache]: Analyzing trace with hash 547115351, now seen corresponding path program 1 times [2024-11-09 06:25:41,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:25:41,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028669426] [2024-11-09 06:25:41,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:41,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms