./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe37ed55d149c65fede95413b0b499314c3ede2b9eb9a49f03115ea64cafc68c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:21:22,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:21:22,287 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:21:22,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:21:22,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:21:22,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:21:22,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:21:22,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:21:22,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:21:22,313 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:21:22,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:21:22,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:21:22,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:21:22,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:21:22,314 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:21:22,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:21:22,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:21:22,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:21:22,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:21:22,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:21:22,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:21:22,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:21:22,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:21:22,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:21:22,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:21:22,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:21:22,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:21:22,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:21:22,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:21:22,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:21:22,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:21:22,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:21:22,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:21:22,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:21:22,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:21:22,316 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:21:22,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:21:22,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:21:22,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:21:22,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:21:22,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:21:22,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:21:22,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:21:22,317 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> fe37ed55d149c65fede95413b0b499314c3ede2b9eb9a49f03115ea64cafc68c [2025-03-17 10:21:22,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:21:22,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:21:22,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:21:22,561 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:21:22,561 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:21:22,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i [2025-03-17 10:21:23,711 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11c6fd2cf/ec07cf6748284025b70d60d104309db2/FLAG599539e21 [2025-03-17 10:21:24,002 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:21:24,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i [2025-03-17 10:21:24,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11c6fd2cf/ec07cf6748284025b70d60d104309db2/FLAG599539e21 [2025-03-17 10:21:24,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11c6fd2cf/ec07cf6748284025b70d60d104309db2 [2025-03-17 10:21:24,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:21:24,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:21:24,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:21:24,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:21:24,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:21:24,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:21:24" (1/1) ... [2025-03-17 10:21:24,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2629c86b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:24, skipping insertion in model container [2025-03-17 10:21:24,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:21:24" (1/1) ... [2025-03-17 10:21:24,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:21:24,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i[33021,33034] [2025-03-17 10:21:24,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i[45234,45247] [2025-03-17 10:21:24,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:21:24,490 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:21:24,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i[33021,33034] [2025-03-17 10:21:24,558 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i[45234,45247] [2025-03-17 10:21:24,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:21:24,592 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:21:24,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:24 WrapperNode [2025-03-17 10:21:24,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:21:24,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:21:24,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:21:24,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:21:24,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:24" (1/1) ... [2025-03-17 10:21:24,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:24" (1/1) ... [2025-03-17 10:21:24,663 INFO L138 Inliner]: procedures = 177, calls = 340, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1540 [2025-03-17 10:21:24,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:21:24,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:21:24,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:21:24,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:21:24,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:24" (1/1) ... [2025-03-17 10:21:24,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:24" (1/1) ... [2025-03-17 10:21:24,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:24" (1/1) ... [2025-03-17 10:21:24,757 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [268, 2, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 62 writes are split as follows [58, 0, 4]. [2025-03-17 10:21:24,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:24" (1/1) ... [2025-03-17 10:21:24,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:24" (1/1) ... [2025-03-17 10:21:24,792 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:24" (1/1) ... [2025-03-17 10:21:24,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:24" (1/1) ... [2025-03-17 10:21:24,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:24" (1/1) ... [2025-03-17 10:21:24,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:24" (1/1) ... [2025-03-17 10:21:24,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:21:24,821 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:21:24,821 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:21:24,821 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:21:24,822 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:24" (1/1) ... [2025-03-17 10:21:24,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:21:24,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:21:24,847 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) [2025-03-17 10:21:24,851 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 [2025-03-17 10:21:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:21:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:21:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:21:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 10:21:24,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 10:21:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:21:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:21:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:21:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:21:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:21:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 10:21:24,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:21:24,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:21:24,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 10:21:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-03-17 10:21:24,889 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-03-17 10:21:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:21:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:21:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:21:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:21:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:21:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:21:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:21:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:21:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:21:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:21:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:21:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:21:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:21:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:21:24,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:21:25,052 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:21:25,054 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:21:26,120 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-17 10:21:26,220 INFO L? ?]: Removed 354 outVars from TransFormulas that were not future-live. [2025-03-17 10:21:26,220 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:21:26,265 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:21:26,267 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 10:21:26,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:21:26 BoogieIcfgContainer [2025-03-17 10:21:26,267 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:21:26,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:21:26,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:21:26,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:21:26,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:21:24" (1/3) ... [2025-03-17 10:21:26,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61735882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:21:26, skipping insertion in model container [2025-03-17 10:21:26,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:24" (2/3) ... [2025-03-17 10:21:26,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61735882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:21:26, skipping insertion in model container [2025-03-17 10:21:26,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:21:26" (3/3) ... [2025-03-17 10:21:26,274 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test8-2.i [2025-03-17 10:21:26,285 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:21:26,286 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test8-2.i that has 6 procedures, 470 locations, 1 initial locations, 40 loop locations, and 2 error locations. [2025-03-17 10:21:26,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:21:26,347 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;@6cd2630e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:21:26,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 10:21:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 462 states, 436 states have (on average 1.628440366972477) internal successors, (710), 453 states have internal predecessors, (710), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 10:21:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 10:21:26,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:26,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:26,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:26,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:26,359 INFO L85 PathProgramCache]: Analyzing trace with hash 486124315, now seen corresponding path program 1 times [2025-03-17 10:21:26,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:26,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256641881] [2025-03-17 10:21:26,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:26,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:26,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 10:21:26,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 10:21:26,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:26,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:26,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:26,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256641881] [2025-03-17 10:21:26,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256641881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:26,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:26,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:21:26,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108169479] [2025-03-17 10:21:26,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:26,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 10:21:26,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:26,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 10:21:26,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:21:26,505 INFO L87 Difference]: Start difference. First operand has 462 states, 436 states have (on average 1.628440366972477) internal successors, (710), 453 states have internal predecessors, (710), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:26,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:26,632 INFO L93 Difference]: Finished difference Result 923 states and 1516 transitions. [2025-03-17 10:21:26,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 10:21:26,633 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 10:21:26,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:26,643 INFO L225 Difference]: With dead ends: 923 [2025-03-17 10:21:26,643 INFO L226 Difference]: Without dead ends: 425 [2025-03-17 10:21:26,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:21:26,652 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:26,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:21:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-17 10:21:26,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-03-17 10:21:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 400 states have (on average 1.47) internal successors, (588), 416 states have internal predecessors, (588), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 10:21:26,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 628 transitions. [2025-03-17 10:21:26,713 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 628 transitions. Word has length 8 [2025-03-17 10:21:26,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:26,717 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 628 transitions. [2025-03-17 10:21:26,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 628 transitions. [2025-03-17 10:21:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 10:21:26,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:26,719 INFO L218 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] [2025-03-17 10:21:26,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:21:26,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:26,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:26,720 INFO L85 PathProgramCache]: Analyzing trace with hash 497064434, now seen corresponding path program 1 times [2025-03-17 10:21:26,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:26,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106095694] [2025-03-17 10:21:26,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:26,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:26,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 10:21:26,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 10:21:26,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:26,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:27,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:27,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:27,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106095694] [2025-03-17 10:21:27,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106095694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:27,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:27,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:21:27,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650450386] [2025-03-17 10:21:27,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:27,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:21:27,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:27,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:21:27,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:21:27,135 INFO L87 Difference]: Start difference. First operand 425 states and 628 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:27,419 INFO L93 Difference]: Finished difference Result 1030 states and 1522 transitions. [2025-03-17 10:21:27,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:21:27,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-17 10:21:27,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:27,427 INFO L225 Difference]: With dead ends: 1030 [2025-03-17 10:21:27,427 INFO L226 Difference]: Without dead ends: 804 [2025-03-17 10:21:27,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:21:27,429 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 541 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:27,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1693 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:21:27,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-03-17 10:21:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 427. [2025-03-17 10:21:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 402 states have (on average 1.4676616915422886) internal successors, (590), 418 states have internal predecessors, (590), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 10:21:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 630 transitions. [2025-03-17 10:21:27,463 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 630 transitions. Word has length 61 [2025-03-17 10:21:27,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:27,464 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 630 transitions. [2025-03-17 10:21:27,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:27,464 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 630 transitions. [2025-03-17 10:21:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 10:21:27,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:27,467 INFO L218 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] [2025-03-17 10:21:27,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:21:27,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:27,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:27,470 INFO L85 PathProgramCache]: Analyzing trace with hash 328527522, now seen corresponding path program 1 times [2025-03-17 10:21:27,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:27,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146449122] [2025-03-17 10:21:27,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:27,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:27,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 10:21:27,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 10:21:27,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:27,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:27,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:27,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146449122] [2025-03-17 10:21:27,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146449122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:27,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:27,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:21:27,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898386882] [2025-03-17 10:21:27,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:27,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:21:27,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:27,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:21:27,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:21:27,768 INFO L87 Difference]: Start difference. First operand 427 states and 630 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:27,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:27,956 INFO L93 Difference]: Finished difference Result 809 states and 1191 transitions. [2025-03-17 10:21:27,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:21:27,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-17 10:21:27,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:27,961 INFO L225 Difference]: With dead ends: 809 [2025-03-17 10:21:27,963 INFO L226 Difference]: Without dead ends: 385 [2025-03-17 10:21:27,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:21:27,965 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 30 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:27,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1463 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:21:27,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-17 10:21:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-03-17 10:21:27,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 360 states have (on average 1.425) internal successors, (513), 376 states have internal predecessors, (513), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 10:21:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 553 transitions. [2025-03-17 10:21:27,987 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 553 transitions. Word has length 82 [2025-03-17 10:21:27,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:27,990 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 553 transitions. [2025-03-17 10:21:27,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 553 transitions. [2025-03-17 10:21:27,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 10:21:27,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:27,992 INFO L218 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] [2025-03-17 10:21:27,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:21:27,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:27,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:27,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2079526564, now seen corresponding path program 1 times [2025-03-17 10:21:27,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:27,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199124042] [2025-03-17 10:21:27,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:27,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:28,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 10:21:28,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 10:21:28,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:28,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:28,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:28,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199124042] [2025-03-17 10:21:28,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199124042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:28,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:28,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:21:28,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132175141] [2025-03-17 10:21:28,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:28,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:21:28,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:28,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:21:28,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:21:28,176 INFO L87 Difference]: Start difference. First operand 385 states and 553 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:28,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:28,375 INFO L93 Difference]: Finished difference Result 1015 states and 1461 transitions. [2025-03-17 10:21:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:21:28,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-17 10:21:28,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:28,378 INFO L225 Difference]: With dead ends: 1015 [2025-03-17 10:21:28,379 INFO L226 Difference]: Without dead ends: 633 [2025-03-17 10:21:28,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:21:28,380 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 293 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:28,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1169 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:21:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-17 10:21:28,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2025-03-17 10:21:28,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 604 states have (on average 1.4321192052980132) internal successors, (865), 620 states have internal predecessors, (865), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 10:21:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 907 transitions. [2025-03-17 10:21:28,403 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 907 transitions. Word has length 82 [2025-03-17 10:21:28,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:28,404 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 907 transitions. [2025-03-17 10:21:28,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 907 transitions. [2025-03-17 10:21:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 10:21:28,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:28,407 INFO L218 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] [2025-03-17 10:21:28,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:21:28,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:28,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:28,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1720709391, now seen corresponding path program 1 times [2025-03-17 10:21:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:28,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698318616] [2025-03-17 10:21:28,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:28,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:28,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 10:21:28,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 10:21:28,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:28,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:21:28,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:28,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698318616] [2025-03-17 10:21:28,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698318616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:21:28,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922140107] [2025-03-17 10:21:28,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:28,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:21:28,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:21:28,814 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) [2025-03-17 10:21:28,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 10:21:28,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 10:21:29,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 10:21:29,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:29,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:29,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 10:21:29,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:21:29,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 10:21:29,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-03-17 10:21:29,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 10:21:29,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2025-03-17 10:21:29,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:21:29,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:21:29,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922140107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:29,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:21:29,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 13 [2025-03-17 10:21:29,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329200783] [2025-03-17 10:21:29,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:29,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 10:21:29,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:29,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 10:21:29,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-17 10:21:29,787 INFO L87 Difference]: Start difference. First operand 630 states and 907 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 10 states have internal predecessors, (88), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:21:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:30,897 INFO L93 Difference]: Finished difference Result 1514 states and 2180 transitions. [2025-03-17 10:21:30,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 10:21:30,897 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 10 states have internal predecessors, (88), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2025-03-17 10:21:30,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:30,901 INFO L225 Difference]: With dead ends: 1514 [2025-03-17 10:21:30,901 INFO L226 Difference]: Without dead ends: 925 [2025-03-17 10:21:30,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-17 10:21:30,902 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 597 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:30,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 2720 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 10:21:30,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-03-17 10:21:30,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 630. [2025-03-17 10:21:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 604 states have (on average 1.4304635761589404) internal successors, (864), 620 states have internal predecessors, (864), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 10:21:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 906 transitions. [2025-03-17 10:21:30,931 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 906 transitions. Word has length 97 [2025-03-17 10:21:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:30,932 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 906 transitions. [2025-03-17 10:21:30,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 10 states have internal predecessors, (88), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:21:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 906 transitions. [2025-03-17 10:21:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 10:21:30,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:30,933 INFO L218 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] [2025-03-17 10:21:30,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 10:21:31,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:21:31,137 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:31,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:31,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1298648930, now seen corresponding path program 1 times [2025-03-17 10:21:31,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:31,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697837237] [2025-03-17 10:21:31,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:31,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:31,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 10:21:31,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 10:21:31,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:31,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:21:31,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:31,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697837237] [2025-03-17 10:21:31,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697837237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:21:31,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363333375] [2025-03-17 10:21:31,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:31,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:21:31,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:21:31,431 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) [2025-03-17 10:21:31,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 10:21:31,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 10:21:31,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 10:21:31,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:31,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:31,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 10:21:31,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:21:31,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 10:21:31,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-03-17 10:21:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:21:32,483 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:21:32,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363333375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:32,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:21:32,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 14 [2025-03-17 10:21:32,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804989683] [2025-03-17 10:21:32,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:32,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 10:21:32,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:32,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 10:21:32,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-17 10:21:32,486 INFO L87 Difference]: Start difference. First operand 630 states and 906 transitions. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:21:34,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:34,110 INFO L93 Difference]: Finished difference Result 1529 states and 2200 transitions. [2025-03-17 10:21:34,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 10:21:34,111 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2025-03-17 10:21:34,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:34,114 INFO L225 Difference]: With dead ends: 1529 [2025-03-17 10:21:34,114 INFO L226 Difference]: Without dead ends: 945 [2025-03-17 10:21:34,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-17 10:21:34,116 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 645 mSDsluCounter, 3027 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 3518 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:34,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 3518 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 10:21:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-03-17 10:21:34,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 646. [2025-03-17 10:21:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 620 states have (on average 1.4258064516129032) internal successors, (884), 636 states have internal predecessors, (884), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 10:21:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 926 transitions. [2025-03-17 10:21:34,135 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 926 transitions. Word has length 98 [2025-03-17 10:21:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:34,135 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 926 transitions. [2025-03-17 10:21:34,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:21:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 926 transitions. [2025-03-17 10:21:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 10:21:34,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:34,136 INFO L218 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] [2025-03-17 10:21:34,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 10:21:34,336 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,SelfDestructingSolverStorable5 [2025-03-17 10:21:34,337 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:34,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:34,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1099955272, now seen corresponding path program 1 times [2025-03-17 10:21:34,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:34,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830434409] [2025-03-17 10:21:34,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:34,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:34,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 10:21:34,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 10:21:34,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:34,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:21:34,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830434409] [2025-03-17 10:21:34,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830434409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:34,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:34,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 10:21:34,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306232678] [2025-03-17 10:21:34,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:34,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:21:34,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:34,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:21:34,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:21:34,578 INFO L87 Difference]: Start difference. First operand 646 states and 926 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:21:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:34,895 INFO L93 Difference]: Finished difference Result 1247 states and 1800 transitions. [2025-03-17 10:21:34,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:21:34,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2025-03-17 10:21:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:34,902 INFO L225 Difference]: With dead ends: 1247 [2025-03-17 10:21:34,902 INFO L226 Difference]: Without dead ends: 656 [2025-03-17 10:21:34,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:21:34,906 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 14 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:34,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2678 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:21:34,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-03-17 10:21:34,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 654. [2025-03-17 10:21:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 628 states have (on average 1.4235668789808917) internal successors, (894), 644 states have internal predecessors, (894), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 10:21:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 936 transitions. [2025-03-17 10:21:34,925 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 936 transitions. Word has length 99 [2025-03-17 10:21:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:34,925 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 936 transitions. [2025-03-17 10:21:34,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:21:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 936 transitions. [2025-03-17 10:21:34,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 10:21:34,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:34,927 INFO L218 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] [2025-03-17 10:21:34,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:21:34,928 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:34,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:34,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1706790004, now seen corresponding path program 1 times [2025-03-17 10:21:34,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:34,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559661058] [2025-03-17 10:21:34,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:34,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:34,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 10:21:34,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 10:21:34,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:34,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:35,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:21:35,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:35,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559661058] [2025-03-17 10:21:35,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559661058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:35,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:35,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:21:35,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939684155] [2025-03-17 10:21:35,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:35,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:21:35,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:35,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:21:35,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:21:35,166 INFO L87 Difference]: Start difference. First operand 654 states and 936 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:21:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:35,445 INFO L93 Difference]: Finished difference Result 1262 states and 1820 transitions. [2025-03-17 10:21:35,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:21:35,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2025-03-17 10:21:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:35,449 INFO L225 Difference]: With dead ends: 1262 [2025-03-17 10:21:35,449 INFO L226 Difference]: Without dead ends: 660 [2025-03-17 10:21:35,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:21:35,450 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 9 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:35,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2252 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:21:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-03-17 10:21:35,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-03-17 10:21:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 634 states have (on average 1.4195583596214512) internal successors, (900), 650 states have internal predecessors, (900), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 10:21:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 942 transitions. [2025-03-17 10:21:35,471 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 942 transitions. Word has length 99 [2025-03-17 10:21:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:35,472 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 942 transitions. [2025-03-17 10:21:35,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:21:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 942 transitions. [2025-03-17 10:21:35,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 10:21:35,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:35,473 INFO L218 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] [2025-03-17 10:21:35,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:21:35,473 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:35,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:35,473 INFO L85 PathProgramCache]: Analyzing trace with hash 356663671, now seen corresponding path program 1 times [2025-03-17 10:21:35,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:35,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603151753] [2025-03-17 10:21:35,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:35,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:35,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 10:21:35,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 10:21:35,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:35,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:21:35,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:35,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603151753] [2025-03-17 10:21:35,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603151753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:21:35,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928493274] [2025-03-17 10:21:35,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:35,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:21:35,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:21:35,769 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:21:35,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 10:21:35,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 10:21:36,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 10:21:36,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:36,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:36,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 10:21:36,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:21:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:21:36,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:21:36,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928493274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:36,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:21:36,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-17 10:21:36,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562478454] [2025-03-17 10:21:36,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:36,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:21:36,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:36,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:21:36,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:21:36,121 INFO L87 Difference]: Start difference. First operand 660 states and 942 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:21:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:36,450 INFO L93 Difference]: Finished difference Result 1278 states and 1837 transitions. [2025-03-17 10:21:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 10:21:36,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-03-17 10:21:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:36,454 INFO L225 Difference]: With dead ends: 1278 [2025-03-17 10:21:36,454 INFO L226 Difference]: Without dead ends: 666 [2025-03-17 10:21:36,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 10:21:36,457 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 42 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 2699 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:36,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 2699 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:21:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-17 10:21:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 648. [2025-03-17 10:21:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 622 states have (on average 1.4180064308681672) internal successors, (882), 638 states have internal predecessors, (882), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 10:21:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 924 transitions. [2025-03-17 10:21:36,477 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 924 transitions. Word has length 100 [2025-03-17 10:21:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:36,477 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 924 transitions. [2025-03-17 10:21:36,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:21:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 924 transitions. [2025-03-17 10:21:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 10:21:36,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:36,480 INFO L218 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] [2025-03-17 10:21:36,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 10:21:36,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:21:36,680 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:21:36,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:36,681 INFO L85 PathProgramCache]: Analyzing trace with hash 609126257, now seen corresponding path program 1 times [2025-03-17 10:21:36,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:36,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737987418] [2025-03-17 10:21:36,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:36,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:36,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 10:21:36,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 10:21:36,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:36,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:21:36,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:36,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737987418] [2025-03-17 10:21:36,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737987418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:21:36,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888712746] [2025-03-17 10:21:36,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:36,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:21:36,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:21:36,892 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:21:36,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 10:21:37,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 10:21:37,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 10:21:37,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:37,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:37,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 10:21:37,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:21:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:21:52,611 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:21:52,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888712746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:52,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:21:52,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-17 10:21:52,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679061801] [2025-03-17 10:21:52,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:52,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:21:52,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:52,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:21:52,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:21:52,613 INFO L87 Difference]: Start difference. First operand 648 states and 924 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:21:55,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 10:22:00,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 10:22:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:22:00,672 INFO L93 Difference]: Finished difference Result 1246 states and 1792 transitions. [2025-03-17 10:22:00,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:22:00,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-03-17 10:22:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:22:00,675 INFO L225 Difference]: With dead ends: 1246 [2025-03-17 10:22:00,675 INFO L226 Difference]: Without dead ends: 658 [2025-03-17 10:22:00,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:22:00,677 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 12 mSDsluCounter, 2185 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:22:00,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2684 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 571 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2025-03-17 10:22:00,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-03-17 10:22:00,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 648. [2025-03-17 10:22:00,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 622 states have (on average 1.4180064308681672) internal successors, (882), 638 states have internal predecessors, (882), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 10:22:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 924 transitions. [2025-03-17 10:22:00,693 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 924 transitions. Word has length 100 [2025-03-17 10:22:00,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:22:00,693 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 924 transitions. [2025-03-17 10:22:00,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:22:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 924 transitions. [2025-03-17 10:22:00,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 10:22:00,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:22:00,694 INFO L218 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] [2025-03-17 10:22:00,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 10:22:00,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:22:00,895 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:22:00,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:22:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash 960364115, now seen corresponding path program 1 times [2025-03-17 10:22:00,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:22:00,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622900661] [2025-03-17 10:22:00,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:22:00,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:22:00,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 10:22:00,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 10:22:00,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:22:00,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:22:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:22:01,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:22:01,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622900661] [2025-03-17 10:22:01,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622900661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:22:01,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:22:01,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 10:22:01,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772446948] [2025-03-17 10:22:01,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:22:01,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:22:01,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:22:01,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:22:01,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:22:01,232 INFO L87 Difference]: Start difference. First operand 648 states and 924 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:22:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:22:01,663 INFO L93 Difference]: Finished difference Result 1268 states and 1821 transitions. [2025-03-17 10:22:01,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:22:01,664 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-03-17 10:22:01,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:22:01,667 INFO L225 Difference]: With dead ends: 1268 [2025-03-17 10:22:01,667 INFO L226 Difference]: Without dead ends: 680 [2025-03-17 10:22:01,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:22:01,670 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 26 mSDsluCounter, 2690 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3190 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:22:01,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3190 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:22:01,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-03-17 10:22:01,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 668. [2025-03-17 10:22:01,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 642 states have (on average 1.411214953271028) internal successors, (906), 658 states have internal predecessors, (906), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 10:22:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 948 transitions. [2025-03-17 10:22:01,691 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 948 transitions. Word has length 102 [2025-03-17 10:22:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:22:01,691 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 948 transitions. [2025-03-17 10:22:01,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:22:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 948 transitions. [2025-03-17 10:22:01,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 10:22:01,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:22:01,692 INFO L218 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] [2025-03-17 10:22:01,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:22:01,692 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:22:01,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:22:01,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1374660558, now seen corresponding path program 1 times [2025-03-17 10:22:01,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:22:01,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046165842] [2025-03-17 10:22:01,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:22:01,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:22:01,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 10:22:01,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 10:22:01,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:22:01,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:22:01,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:22:01,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:22:01,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046165842] [2025-03-17 10:22:01,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046165842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:22:01,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494565171] [2025-03-17 10:22:01,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:22:01,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:22:01,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:22:01,907 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:22:01,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 10:22:02,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 10:22:02,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 10:22:02,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:22:02,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:22:02,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 10:22:02,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:22:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:22:02,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:22:02,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494565171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:22:02,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:22:02,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-17 10:22:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108519253] [2025-03-17 10:22:02,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:22:02,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:22:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:22:02,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:22:02,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:22:02,226 INFO L87 Difference]: Start difference. First operand 668 states and 948 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:22:02,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:22:02,325 INFO L93 Difference]: Finished difference Result 1232 states and 1763 transitions. [2025-03-17 10:22:02,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:22:02,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-03-17 10:22:02,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:22:02,329 INFO L225 Difference]: With dead ends: 1232 [2025-03-17 10:22:02,330 INFO L226 Difference]: Without dead ends: 671 [2025-03-17 10:22:02,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:22:02,331 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 0 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:22:02,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1520 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:22:02,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-17 10:22:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2025-03-17 10:22:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 644 states have (on average 1.4114906832298137) internal successors, (909), 661 states have internal predecessors, (909), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-17 10:22:02,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 952 transitions. [2025-03-17 10:22:02,348 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 952 transitions. Word has length 102 [2025-03-17 10:22:02,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:22:02,349 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 952 transitions. [2025-03-17 10:22:02,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:22:02,350 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 952 transitions. [2025-03-17 10:22:02,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 10:22:02,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:22:02,350 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:22:02,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 10:22:02,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 10:22:02,551 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:22:02,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:22:02,552 INFO L85 PathProgramCache]: Analyzing trace with hash 839395346, now seen corresponding path program 1 times [2025-03-17 10:22:02,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:22:02,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723558200] [2025-03-17 10:22:02,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:22:02,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:22:02,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 10:22:02,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 10:22:02,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:22:02,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:22:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 10:22:02,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:22:02,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723558200] [2025-03-17 10:22:02,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723558200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:22:02,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680459495] [2025-03-17 10:22:02,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:22:02,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:22:02,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:22:02,856 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:22:02,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 10:22:03,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 10:22:03,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 10:22:03,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:22:03,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:22:03,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 10:22:03,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:22:03,352 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 10:22:03,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:22:03,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680459495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:22:03,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:22:03,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-17 10:22:03,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645842342] [2025-03-17 10:22:03,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:22:03,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:22:03,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:22:03,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:22:03,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:22:03,353 INFO L87 Difference]: Start difference. First operand 671 states and 952 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:22:03,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:22:03,742 INFO L93 Difference]: Finished difference Result 1282 states and 1836 transitions. [2025-03-17 10:22:03,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:22:03,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-03-17 10:22:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:22:03,746 INFO L225 Difference]: With dead ends: 1282 [2025-03-17 10:22:03,746 INFO L226 Difference]: Without dead ends: 681 [2025-03-17 10:22:03,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:22:03,749 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 10 mSDsluCounter, 2185 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:22:03,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2684 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:22:03,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-17 10:22:03,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 671. [2025-03-17 10:22:03,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 644 states have (on average 1.4114906832298137) internal successors, (909), 661 states have internal predecessors, (909), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-17 10:22:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 952 transitions. [2025-03-17 10:22:03,769 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 952 transitions. Word has length 104 [2025-03-17 10:22:03,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:22:03,769 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 952 transitions. [2025-03-17 10:22:03,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:22:03,770 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 952 transitions. [2025-03-17 10:22:03,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 10:22:03,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:22:03,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:22:03,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 10:22:03,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:22:03,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:22:03,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:22:03,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1108303406, now seen corresponding path program 1 times [2025-03-17 10:22:03,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:22:03,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110058190] [2025-03-17 10:22:03,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:22:03,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:22:04,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 10:22:04,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 10:22:04,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:22:04,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:22:04,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 10:22:04,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:22:04,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110058190] [2025-03-17 10:22:04,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110058190] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:22:04,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276980816] [2025-03-17 10:22:04,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:22:04,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:22:04,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:22:04,240 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:22:04,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 10:22:04,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 10:22:04,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 10:22:04,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:22:04,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:22:04,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 10:22:04,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:22:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 10:22:05,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:22:05,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276980816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:22:05,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:22:05,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2025-03-17 10:22:05,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222779089] [2025-03-17 10:22:05,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:22:05,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:22:05,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:22:05,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:22:05,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-17 10:22:05,163 INFO L87 Difference]: Start difference. First operand 671 states and 952 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:22:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:22:06,081 INFO L93 Difference]: Finished difference Result 1302 states and 1863 transitions. [2025-03-17 10:22:06,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:22:06,082 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-03-17 10:22:06,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:22:06,085 INFO L225 Difference]: With dead ends: 1302 [2025-03-17 10:22:06,085 INFO L226 Difference]: Without dead ends: 701 [2025-03-17 10:22:06,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-17 10:22:06,087 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 17 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4056 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 10:22:06,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4056 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 10:22:06,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-03-17 10:22:06,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 695. [2025-03-17 10:22:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 668 states have (on average 1.405688622754491) internal successors, (939), 685 states have internal predecessors, (939), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-17 10:22:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 982 transitions. [2025-03-17 10:22:06,105 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 982 transitions. Word has length 104 [2025-03-17 10:22:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:22:06,105 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 982 transitions. [2025-03-17 10:22:06,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:22:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 982 transitions. [2025-03-17 10:22:06,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 10:22:06,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:22:06,107 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:22:06,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 10:22:06,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:22:06,308 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:22:06,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:22:06,309 INFO L85 PathProgramCache]: Analyzing trace with hash 419020140, now seen corresponding path program 1 times [2025-03-17 10:22:06,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:22:06,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565823264] [2025-03-17 10:22:06,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:22:06,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:22:06,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 10:22:06,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 10:22:06,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:22:06,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:22:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 10:22:06,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:22:06,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565823264] [2025-03-17 10:22:06,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565823264] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:22:06,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553979925] [2025-03-17 10:22:06,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:22:06,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:22:06,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:22:06,556 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:22:06,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 10:22:06,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 10:22:07,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 10:22:07,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:22:07,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:22:07,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 10:22:07,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:22:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 10:22:07,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:22:07,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 10:22:07,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553979925] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:22:07,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:22:07,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 10:22:07,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618310286] [2025-03-17 10:22:07,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:22:07,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:22:07,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:22:07,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:22:07,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:22:07,594 INFO L87 Difference]: Start difference. First operand 695 states and 982 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 10:22:07,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:22:07,737 INFO L93 Difference]: Finished difference Result 1282 states and 1830 transitions. [2025-03-17 10:22:07,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:22:07,738 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 105 [2025-03-17 10:22:07,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:22:07,740 INFO L225 Difference]: With dead ends: 1282 [2025-03-17 10:22:07,740 INFO L226 Difference]: Without dead ends: 704 [2025-03-17 10:22:07,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-17 10:22:07,742 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 5 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:22:07,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1526 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:22:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-03-17 10:22:07,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2025-03-17 10:22:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 676 states have (on average 1.4068047337278107) internal successors, (951), 693 states have internal predecessors, (951), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (23), 7 states have call predecessors, (23), 21 states have call successors, (23) [2025-03-17 10:22:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 995 transitions. [2025-03-17 10:22:07,762 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 995 transitions. Word has length 105 [2025-03-17 10:22:07,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:22:07,762 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 995 transitions. [2025-03-17 10:22:07,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 10:22:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 995 transitions. [2025-03-17 10:22:07,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 10:22:07,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:22:07,764 INFO L218 NwaCegarLoop]: trace histogram [6, 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] [2025-03-17 10:22:07,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 10:22:07,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 10:22:07,965 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:22:07,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:22:07,965 INFO L85 PathProgramCache]: Analyzing trace with hash -678760856, now seen corresponding path program 2 times [2025-03-17 10:22:07,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:22:07,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305055921] [2025-03-17 10:22:07,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:22:07,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:22:07,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-17 10:22:08,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 96 of 109 statements. [2025-03-17 10:22:08,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:22:08,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:22:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-17 10:22:08,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:22:08,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305055921] [2025-03-17 10:22:08,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305055921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:22:08,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:22:08,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 10:22:08,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523220772] [2025-03-17 10:22:08,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:22:08,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:22:08,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:22:08,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:22:08,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:22:08,317 INFO L87 Difference]: Start difference. First operand 704 states and 995 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:22:08,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:22:08,888 INFO L93 Difference]: Finished difference Result 1330 states and 1897 transitions. [2025-03-17 10:22:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:22:08,889 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 109 [2025-03-17 10:22:08,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:22:08,891 INFO L225 Difference]: With dead ends: 1330 [2025-03-17 10:22:08,891 INFO L226 Difference]: Without dead ends: 718 [2025-03-17 10:22:08,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:22:08,894 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 13 mSDsluCounter, 3513 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4005 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:22:08,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4005 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:22:08,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-03-17 10:22:08,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 704. [2025-03-17 10:22:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 676 states have (on average 1.4068047337278107) internal successors, (951), 693 states have internal predecessors, (951), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (23), 7 states have call predecessors, (23), 21 states have call successors, (23) [2025-03-17 10:22:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 995 transitions. [2025-03-17 10:22:08,912 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 995 transitions. Word has length 109 [2025-03-17 10:22:08,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:22:08,914 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 995 transitions. [2025-03-17 10:22:08,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:22:08,914 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 995 transitions. [2025-03-17 10:22:08,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 10:22:08,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:22:08,915 INFO L218 NwaCegarLoop]: trace histogram [6, 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] [2025-03-17 10:22:08,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:22:08,915 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:22:08,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:22:08,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2059440000, now seen corresponding path program 1 times [2025-03-17 10:22:08,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:22:08,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315974374] [2025-03-17 10:22:08,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:22:08,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:22:08,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 10:22:08,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 10:22:08,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:22:08,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:22:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 10:22:09,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:22:09,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315974374] [2025-03-17 10:22:09,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315974374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:22:09,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975651730] [2025-03-17 10:22:09,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:22:09,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:22:09,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:22:09,154 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:22:09,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 10:22:09,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 10:22:09,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 10:22:09,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:22:09,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:22:09,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 10:22:09,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:22:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 10:22:09,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:22:09,592 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 10:22:09,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975651730] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:22:09,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:22:09,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2025-03-17 10:22:09,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459730237] [2025-03-17 10:22:09,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:22:09,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 10:22:09,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:22:09,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 10:22:09,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-17 10:22:09,594 INFO L87 Difference]: Start difference. First operand 704 states and 995 transitions. Second operand has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 13 states have internal predecessors, (114), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:22:09,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:22:09,808 INFO L93 Difference]: Finished difference Result 1297 states and 1849 transitions. [2025-03-17 10:22:09,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 10:22:09,808 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 13 states have internal predecessors, (114), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 109 [2025-03-17 10:22:09,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:22:09,811 INFO L225 Difference]: With dead ends: 1297 [2025-03-17 10:22:09,811 INFO L226 Difference]: Without dead ends: 712 [2025-03-17 10:22:09,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2025-03-17 10:22:09,812 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 28 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2466 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:22:09,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2466 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:22:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-03-17 10:22:09,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 708. [2025-03-17 10:22:09,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 680 states have (on average 1.410294117647059) internal successors, (959), 697 states have internal predecessors, (959), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-17 10:22:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1002 transitions. [2025-03-17 10:22:09,827 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1002 transitions. Word has length 109 [2025-03-17 10:22:09,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:22:09,827 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 1002 transitions. [2025-03-17 10:22:09,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 13 states have internal predecessors, (114), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:22:09,828 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1002 transitions. [2025-03-17 10:22:09,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 10:22:09,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:22:09,828 INFO L218 NwaCegarLoop]: trace histogram [10, 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] [2025-03-17 10:22:09,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 10:22:10,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 10:22:10,033 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:22:10,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:22:10,034 INFO L85 PathProgramCache]: Analyzing trace with hash -199316736, now seen corresponding path program 2 times [2025-03-17 10:22:10,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:22:10,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975361070] [2025-03-17 10:22:10,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:22:10,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:22:10,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-03-17 10:22:10,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 96 of 113 statements. [2025-03-17 10:22:10,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:22:10,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:22:32,490 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2025-03-17 10:22:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-17 10:22:32,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:22:32,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975361070] [2025-03-17 10:22:32,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975361070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:22:32,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:22:32,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 10:22:32,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445096575] [2025-03-17 10:22:32,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:22:32,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 10:22:32,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:22:32,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 10:22:32,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-03-17 10:22:32,537 INFO L87 Difference]: Start difference. First operand 708 states and 1002 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:22:34,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:22:40,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:22:44,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:22:48,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:22:52,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:22:56,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []