./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-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_test4-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 c24ad121bcc9573550d02da9627a07166858762ae4177dec26b10c884148a83b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:24:46,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:24:46,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 06:24:46,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:24:46,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:24:46,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:24:46,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:24:46,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:24:46,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 06:24:46,419 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 06:24:46,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:24:46,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:24:46,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:24:46,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:24:46,423 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:24:46,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:24:46,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:24:46,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:24:46,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:24:46,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:24:46,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:24:46,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:24:46,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:24:46,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:24:46,430 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:24:46,431 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:24:46,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:24:46,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:24:46,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:24:46,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:24:46,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:24:46,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:24:46,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:24:46,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:24:46,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:24:46,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:24:46,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:24:46,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:24:46,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:24:46,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:24:46,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:24:46,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:24:46,438 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 -> c24ad121bcc9573550d02da9627a07166858762ae4177dec26b10c884148a83b [2024-11-09 06:24:46,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:24:46,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:24:46,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:24:46,786 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:24:46,786 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:24:46,788 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_test4-3.i [2024-11-09 06:24:48,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:24:48,729 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:24:48,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-3.i [2024-11-09 06:24:48,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/932dc136c/b45f47f3c4944dd6b80ab40c17171376/FLAG94f6e2241 [2024-11-09 06:24:48,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/932dc136c/b45f47f3c4944dd6b80ab40c17171376 [2024-11-09 06:24:48,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:24:48,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:24:48,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:24:48,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:24:48,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:24:48,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:24:48" (1/1) ... [2024-11-09 06:24:48,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10b744dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:48, skipping insertion in model container [2024-11-09 06:24:48,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:24:48" (1/1) ... [2024-11-09 06:24:48,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:24:49,316 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_test4-3.i[33021,33034] [2024-11-09 06:24:49,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:24:49,498 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:24:49,539 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_test4-3.i[33021,33034] [2024-11-09 06:24:49,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:24:49,692 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:24:49,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:49 WrapperNode [2024-11-09 06:24:49,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:24:49,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:24:49,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:24:49,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:24:49,704 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:24:49" (1/1) ... [2024-11-09 06:24:49,748 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:24:49" (1/1) ... [2024-11-09 06:24:49,853 INFO L138 Inliner]: procedures = 176, calls = 434, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1901 [2024-11-09 06:24:49,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:24:49,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:24:49,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:24:49,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:24:49,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:49" (1/1) ... [2024-11-09 06:24:49,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:49" (1/1) ... [2024-11-09 06:24:49,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:49" (1/1) ... [2024-11-09 06:24:50,129 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-11-09 06:24:50,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:49" (1/1) ... [2024-11-09 06:24:50,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:49" (1/1) ... [2024-11-09 06:24:50,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:49" (1/1) ... [2024-11-09 06:24:50,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:49" (1/1) ... [2024-11-09 06:24:50,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:49" (1/1) ... [2024-11-09 06:24:50,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:49" (1/1) ... [2024-11-09 06:24:50,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:24:50,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:24:50,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:24:50,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:24:50,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:49" (1/1) ... [2024-11-09 06:24:50,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:24:50,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:24:50,319 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:24:50,327 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:24:50,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 06:24:50,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 06:24:50,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 06:24:50,390 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 06:24:50,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 06:24:50,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 06:24:50,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 06:24:50,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 06:24:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 06:24:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 06:24:50,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:24:50,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:24:50,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 06:24:50,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 06:24:50,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 06:24:50,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 06:24:50,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:24:50,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 06:24:50,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 06:24:50,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:24:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:24:50,708 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:24:50,711 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:24:52,663 INFO L? ?]: Removed 430 outVars from TransFormulas that were not future-live. [2024-11-09 06:24:52,663 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:24:52,696 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:24:52,701 INFO L316 CfgBuilder]: Removed 77 assume(true) statements. [2024-11-09 06:24:52,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:24:52 BoogieIcfgContainer [2024-11-09 06:24:52,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:24:52,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:24:52,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:24:52,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:24:52,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:24:48" (1/3) ... [2024-11-09 06:24:52,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3377d71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:24:52, skipping insertion in model container [2024-11-09 06:24:52,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:24:49" (2/3) ... [2024-11-09 06:24:52,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3377d71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:24:52, skipping insertion in model container [2024-11-09 06:24:52,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:24:52" (3/3) ... [2024-11-09 06:24:52,713 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test4-3.i [2024-11-09 06:24:52,732 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:24:52,733 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 06:24:52,812 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:24:52,820 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;@1f90dac3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:24:52,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 06:24:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 487 states, 467 states have (on average 1.6209850107066381) internal successors, (757), 478 states have internal predecessors, (757), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:24:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 06:24:52,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:52,835 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:24:52,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:52,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:52,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1157084828, now seen corresponding path program 1 times [2024-11-09 06:24:52,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:52,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385742030] [2024-11-09 06:24:52,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:52,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:53,103 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:24:53,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:53,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385742030] [2024-11-09 06:24:53,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385742030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:24:53,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:24:53,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:24:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709462225] [2024-11-09 06:24:53,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:24:53,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:24:53,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:53,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:24:53,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:24:53,146 INFO L87 Difference]: Start difference. First operand has 487 states, 467 states have (on average 1.6209850107066381) internal successors, (757), 478 states have internal predecessors, (757), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:24:53,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:53,333 INFO L93 Difference]: Finished difference Result 1356 states and 2211 transitions. [2024-11-09 06:24:53,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:24:53,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 06:24:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:53,363 INFO L225 Difference]: With dead ends: 1356 [2024-11-09 06:24:53,364 INFO L226 Difference]: Without dead ends: 805 [2024-11-09 06:24:53,371 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:24:53,375 INFO L432 NwaCegarLoop]: 748 mSDtfsCounter, 545 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1447 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:24:53,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1447 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:24:53,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-09 06:24:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 422. [2024-11-09 06:24:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 403 states have (on average 1.4491315136476426) internal successors, (584), 413 states have internal predecessors, (584), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:24:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 616 transitions. [2024-11-09 06:24:53,481 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 616 transitions. Word has length 10 [2024-11-09 06:24:53,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:53,483 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 616 transitions. [2024-11-09 06:24:53,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:24:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 616 transitions. [2024-11-09 06:24:53,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 06:24:53,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:53,496 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] [2024-11-09 06:24:53,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:24:53,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:53,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:53,498 INFO L85 PathProgramCache]: Analyzing trace with hash 482075133, now seen corresponding path program 1 times [2024-11-09 06:24:53,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:53,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099152964] [2024-11-09 06:24:53,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:53,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:54,350 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:24:54,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:54,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099152964] [2024-11-09 06:24:54,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099152964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:24:54,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:24:54,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:24:54,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221844560] [2024-11-09 06:24:54,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:24:54,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:24:54,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:54,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:24:54,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:24:54,359 INFO L87 Difference]: Start difference. First operand 422 states and 616 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:24:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:54,503 INFO L93 Difference]: Finished difference Result 844 states and 1232 transitions. [2024-11-09 06:24:54,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:24:54,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2024-11-09 06:24:54,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:54,512 INFO L225 Difference]: With dead ends: 844 [2024-11-09 06:24:54,512 INFO L226 Difference]: Without dead ends: 425 [2024-11-09 06:24:54,514 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:24:54,517 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 105 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1668 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:24:54,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1668 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:24:54,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-09 06:24:54,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2024-11-09 06:24:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 403 states have (on average 1.4317617866004964) internal successors, (577), 413 states have internal predecessors, (577), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:24:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 609 transitions. [2024-11-09 06:24:54,557 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 609 transitions. Word has length 156 [2024-11-09 06:24:54,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:54,558 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 609 transitions. [2024-11-09 06:24:54,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:24:54,558 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 609 transitions. [2024-11-09 06:24:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 06:24:54,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:54,562 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] [2024-11-09 06:24:54,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:24:54,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:54,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:54,563 INFO L85 PathProgramCache]: Analyzing trace with hash -90991759, now seen corresponding path program 1 times [2024-11-09 06:24:54,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:54,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884968685] [2024-11-09 06:24:54,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:54,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:54,924 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:24:54,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:54,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884968685] [2024-11-09 06:24:54,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884968685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:24:54,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:24:54,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:24:54,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024376978] [2024-11-09 06:24:54,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:24:54,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:24:54,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:54,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:24:54,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:24:54,929 INFO L87 Difference]: Start difference. First operand 422 states and 609 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:24:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:54,986 INFO L93 Difference]: Finished difference Result 970 states and 1404 transitions. [2024-11-09 06:24:54,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:24:54,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2024-11-09 06:24:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:54,997 INFO L225 Difference]: With dead ends: 970 [2024-11-09 06:24:54,997 INFO L226 Difference]: Without dead ends: 551 [2024-11-09 06:24:54,999 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:24:55,000 INFO L432 NwaCegarLoop]: 607 mSDtfsCounter, 134 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1207 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:24:55,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1207 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:24:55,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-09 06:24:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2024-11-09 06:24:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 532 states have (on average 1.4379699248120301) internal successors, (765), 542 states have internal predecessors, (765), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:24:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 797 transitions. [2024-11-09 06:24:55,075 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 797 transitions. Word has length 156 [2024-11-09 06:24:55,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:55,075 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 797 transitions. [2024-11-09 06:24:55,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:24:55,076 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 797 transitions. [2024-11-09 06:24:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:24:55,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:55,081 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] [2024-11-09 06:24:55,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:24:55,082 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:55,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash 615861504, now seen corresponding path program 1 times [2024-11-09 06:24:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:55,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33944687] [2024-11-09 06:24:55,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:55,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:55,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 06:24:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:55,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 06:24:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:55,621 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:24:55,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:55,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33944687] [2024-11-09 06:24:55,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33944687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:24:55,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:24:55,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:24:55,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077408174] [2024-11-09 06:24:55,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:24:55,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:24:55,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:55,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:24:55,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:24:55,626 INFO L87 Difference]: Start difference. First operand 551 states and 797 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:24:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:56,148 INFO L93 Difference]: Finished difference Result 931 states and 1346 transitions. [2024-11-09 06:24:56,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:24:56,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2024-11-09 06:24:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:56,156 INFO L225 Difference]: With dead ends: 931 [2024-11-09 06:24:56,157 INFO L226 Difference]: Without dead ends: 512 [2024-11-09 06:24:56,158 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:24:56,159 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 44 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:24:56,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1843 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:24:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-11-09 06:24:56,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 509. [2024-11-09 06:24:56,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 490 states have (on average 1.4040816326530612) internal successors, (688), 500 states have internal predecessors, (688), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:24:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 720 transitions. [2024-11-09 06:24:56,180 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 720 transitions. Word has length 171 [2024-11-09 06:24:56,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:56,181 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 720 transitions. [2024-11-09 06:24:56,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:24:56,181 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 720 transitions. [2024-11-09 06:24:56,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:24:56,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:56,184 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] [2024-11-09 06:24:56,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:24:56,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:56,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:56,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1132381164, now seen corresponding path program 1 times [2024-11-09 06:24:56,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:56,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595727522] [2024-11-09 06:24:56,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:56,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:56,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 06:24:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:56,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 06:24:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:56,578 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:24:56,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:56,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595727522] [2024-11-09 06:24:56,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595727522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:24:56,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:24:56,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:24:56,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979686076] [2024-11-09 06:24:56,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:24:56,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:24:56,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:56,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:24:56,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:24:56,583 INFO L87 Difference]: Start difference. First operand 509 states and 720 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:24:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:57,021 INFO L93 Difference]: Finished difference Result 883 states and 1252 transitions. [2024-11-09 06:24:57,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:24:57,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2024-11-09 06:24:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:57,027 INFO L225 Difference]: With dead ends: 883 [2024-11-09 06:24:57,027 INFO L226 Difference]: Without dead ends: 506 [2024-11-09 06:24:57,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:24:57,031 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 17 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:24:57,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1850 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:24:57,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-09 06:24:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 503. [2024-11-09 06:24:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 484 states have (on average 1.4008264462809918) internal successors, (678), 494 states have internal predecessors, (678), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:24:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 710 transitions. [2024-11-09 06:24:57,057 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 710 transitions. Word has length 171 [2024-11-09 06:24:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:57,058 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 710 transitions. [2024-11-09 06:24:57,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:24:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 710 transitions. [2024-11-09 06:24:57,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:24:57,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:57,061 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] [2024-11-09 06:24:57,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:24:57,062 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:57,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:57,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2007390964, now seen corresponding path program 1 times [2024-11-09 06:24:57,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:57,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812914500] [2024-11-09 06:24:57,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:57,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:57,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 06:24:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:57,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 06:24:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:57,426 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:24:57,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:57,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812914500] [2024-11-09 06:24:57,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812914500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:24:57,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:24:57,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:24:57,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831209825] [2024-11-09 06:24:57,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:24:57,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:24:57,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:57,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:24:57,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:24:57,431 INFO L87 Difference]: Start difference. First operand 503 states and 710 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:24:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:57,877 INFO L93 Difference]: Finished difference Result 1017 states and 1429 transitions. [2024-11-09 06:24:57,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:24:57,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2024-11-09 06:24:57,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:57,882 INFO L225 Difference]: With dead ends: 1017 [2024-11-09 06:24:57,882 INFO L226 Difference]: Without dead ends: 646 [2024-11-09 06:24:57,884 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:24:57,884 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 247 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:24:57,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1414 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:24:57,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-09 06:24:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 643. [2024-11-09 06:24:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.3832528180354267) internal successors, (859), 631 states have internal predecessors, (859), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 06:24:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 897 transitions. [2024-11-09 06:24:57,913 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 897 transitions. Word has length 171 [2024-11-09 06:24:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:57,913 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 897 transitions. [2024-11-09 06:24:57,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:24:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 897 transitions. [2024-11-09 06:24:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-09 06:24:57,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:57,916 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] [2024-11-09 06:24:57,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:24:57,917 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:57,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:57,918 INFO L85 PathProgramCache]: Analyzing trace with hash 213489751, now seen corresponding path program 1 times [2024-11-09 06:24:57,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:57,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995159884] [2024-11-09 06:24:57,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:57,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:58,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 06:24:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:58,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 06:24:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:58,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 06:24:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:58,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-09 06:24:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:58,361 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:24:58,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:58,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995159884] [2024-11-09 06:24:58,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995159884] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:24:58,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341818956] [2024-11-09 06:24:58,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:58,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:24:58,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:24:58,365 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:24:58,367 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:24:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:58,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:24:58,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:24:59,202 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:24:59,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:24:59,530 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:24:59,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341818956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:24:59,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:24:59,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-09 06:24:59,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736502414] [2024-11-09 06:24:59,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:24:59,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:24:59,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:59,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:24:59,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:24:59,538 INFO L87 Difference]: Start difference. First operand 643 states and 897 transitions. Second operand has 8 states, 8 states have (on average 60.5) internal successors, (484), 7 states have internal predecessors, (484), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 06:25:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:00,155 INFO L93 Difference]: Finished difference Result 1412 states and 1988 transitions. [2024-11-09 06:25:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:25:00,156 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 60.5) internal successors, (484), 7 states have internal predecessors, (484), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 186 [2024-11-09 06:25:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:00,164 INFO L225 Difference]: With dead ends: 1412 [2024-11-09 06:25:00,164 INFO L226 Difference]: Without dead ends: 1381 [2024-11-09 06:25:00,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 376 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:00,167 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 2076 mSDsluCounter, 2020 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2108 SdHoareTripleChecker+Valid, 2618 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:00,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2108 Valid, 2618 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:25:00,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-11-09 06:25:00,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1378. [2024-11-09 06:25:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1341 states have (on average 1.372110365398956) internal successors, (1840), 1351 states have internal predecessors, (1840), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 25 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 06:25:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1908 transitions. [2024-11-09 06:25:00,215 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1908 transitions. Word has length 186 [2024-11-09 06:25:00,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:00,216 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1908 transitions. [2024-11-09 06:25:00,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 60.5) internal successors, (484), 7 states have internal predecessors, (484), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 06:25:00,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1908 transitions. [2024-11-09 06:25:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2024-11-09 06:25:00,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:00,231 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] [2024-11-09 06:25:00,256 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:00,435 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:00,436 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:00,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:00,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1121082786, now seen corresponding path program 1 times [2024-11-09 06:25:00,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:25:00,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947677603] [2024-11-09 06:25:00,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:00,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:25:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:02,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 06:25:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:02,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 06:25:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:02,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 06:25:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:02,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-09 06:25:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:02,390 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:02,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:25:02,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947677603] [2024-11-09 06:25:02,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947677603] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:25:02,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352535018] [2024-11-09 06:25:02,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:02,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:25:02,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:25:02,396 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:02,397 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:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:03,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 3112 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 06:25:03,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:25:04,479 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:04,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:25:05,304 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:05,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352535018] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:25:05,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:25:05,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-11-09 06:25:05,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012245381] [2024-11-09 06:25:05,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:25:05,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 06:25:05,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:25:05,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 06:25:05,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:25:05,311 INFO L87 Difference]: Start difference. First operand 1378 states and 1908 transitions. Second operand has 14 states, 14 states have (on average 97.14285714285714) internal successors, (1360), 13 states have internal predecessors, (1360), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 06:25:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:06,353 INFO L93 Difference]: Finished difference Result 3428 states and 4811 transitions. [2024-11-09 06:25:06,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:25:06,354 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 97.14285714285714) internal successors, (1360), 13 states have internal predecessors, (1360), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 624 [2024-11-09 06:25:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:06,374 INFO L225 Difference]: With dead ends: 3428 [2024-11-09 06:25:06,375 INFO L226 Difference]: Without dead ends: 3397 [2024-11-09 06:25:06,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1261 GetRequests, 1249 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:25:06,379 INFO L432 NwaCegarLoop]: 684 mSDtfsCounter, 4715 mSDsluCounter, 5993 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4819 SdHoareTripleChecker+Valid, 6677 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:06,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4819 Valid, 6677 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:25:06,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3397 states. [2024-11-09 06:25:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3397 to 3394. [2024-11-09 06:25:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3394 states, 3321 states have (on average 1.3706714844926227) internal successors, (4552), 3331 states have internal predecessors, (4552), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 61 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-09 06:25:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 4692 transitions. [2024-11-09 06:25:06,489 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 4692 transitions. Word has length 624 [2024-11-09 06:25:06,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:06,490 INFO L471 AbstractCegarLoop]: Abstraction has 3394 states and 4692 transitions. [2024-11-09 06:25:06,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 97.14285714285714) internal successors, (1360), 13 states have internal predecessors, (1360), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 06:25:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 4692 transitions. [2024-11-09 06:25:06,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1501 [2024-11-09 06:25:06,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:06,560 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] [2024-11-09 06:25:06,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:25:06,760 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:06,761 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:06,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:06,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1574201992, now seen corresponding path program 2 times [2024-11-09 06:25:06,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:25:06,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897255685] [2024-11-09 06:25:06,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:06,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms