./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 798a7b37 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-?-798a7b3-m [2025-03-04 06:02:04,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:02:04,904 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 06:02:04,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:02:04,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:02:04,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:02:04,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:02:04,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:02:04,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 06:02:04,931 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 06:02:04,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:02:04,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:02:04,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:02:04,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:02:04,932 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:02:04,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:02:04,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:02:04,933 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:02:04,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:02:04,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:02:04,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:02:04,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:02:04,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:02:04,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:02:04,933 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:02:04,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:02:04,934 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:02:04,934 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:02:04,934 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:02:04,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:02:04,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 06:02:04,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:02:04,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:02:04,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:02:04,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:02:04,935 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:02:04,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:02:04,935 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:02:04,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:02:04,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:02:04,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:02:04,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:02:04,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:02:04,935 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-04 06:02:05,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:02:05,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:02:05,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:02:05,169 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:02:05,169 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:02:05,170 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-04 06:02:06,345 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5652c8418/19932217e8664f03b7ac98185f349ec6/FLAG2555076d5 [2025-03-04 06:02:06,649 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:02:06,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i [2025-03-04 06:02:06,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5652c8418/19932217e8664f03b7ac98185f349ec6/FLAG2555076d5 [2025-03-04 06:02:06,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5652c8418/19932217e8664f03b7ac98185f349ec6 [2025-03-04 06:02:06,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:02:06,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:02:06,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:02:06,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:02:06,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:02:06,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:02:06" (1/1) ... [2025-03-04 06:02:06,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35289ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:02:06, skipping insertion in model container [2025-03-04 06:02:06,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:02:06" (1/1) ... [2025-03-04 06:02:06,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:02:07,220 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-04 06:02:07,295 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-04 06:02:07,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:02:07,323 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:02:07,354 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-04 06:02:07,399 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-04 06:02:07,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:02:07,432 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:02:07,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:02:07 WrapperNode [2025-03-04 06:02:07,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:02:07,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:02:07,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:02:07,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:02:07,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:02:07" (1/1) ... [2025-03-04 06:02:07,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:02:07" (1/1) ... [2025-03-04 06:02:07,512 INFO L138 Inliner]: procedures = 177, calls = 340, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1540 [2025-03-04 06:02:07,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:02:07,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:02:07,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:02:07,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:02:07,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:02:07" (1/1) ... [2025-03-04 06:02:07,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:02:07" (1/1) ... [2025-03-04 06:02:07,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:02:07" (1/1) ... [2025-03-04 06:02:07,605 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 34, 268]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2025-03-04 06:02:07,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:02:07" (1/1) ... [2025-03-04 06:02:07,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:02:07" (1/1) ... [2025-03-04 06:02:07,647 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:02:07" (1/1) ... [2025-03-04 06:02:07,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:02:07" (1/1) ... [2025-03-04 06:02:07,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:02:07" (1/1) ... [2025-03-04 06:02:07,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:02:07" (1/1) ... [2025-03-04 06:02:07,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:02:07,670 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:02:07,670 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:02:07,670 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:02:07,671 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:02:07" (1/1) ... [2025-03-04 06:02:07,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:02:07,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:02:07,698 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-04 06:02:07,704 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-04 06:02:07,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 06:02:07,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 06:02:07,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 06:02:07,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 06:02:07,721 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 06:02:07,722 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 06:02:07,722 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 06:02:07,722 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-03-04 06:02:07,722 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 06:02:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:02:07,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:02:07,897 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:02:07,898 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:02:09,007 INFO L1325 $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-04 06:02:09,154 INFO L? ?]: Removed 354 outVars from TransFormulas that were not future-live. [2025-03-04 06:02:09,154 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:02:09,204 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:02:09,207 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 06:02:09,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:02:09 BoogieIcfgContainer [2025-03-04 06:02:09,208 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:02:09,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:02:09,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:02:09,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:02:09,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:02:06" (1/3) ... [2025-03-04 06:02:09,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a735c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:02:09, skipping insertion in model container [2025-03-04 06:02:09,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:02:07" (2/3) ... [2025-03-04 06:02:09,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a735c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:02:09, skipping insertion in model container [2025-03-04 06:02:09,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:02:09" (3/3) ... [2025-03-04 06:02:09,216 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test8-2.i [2025-03-04 06:02:09,227 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:02:09,228 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test8-2.i that has 6 procedures, 471 locations, 1 initial locations, 40 loop locations, and 2 error locations. [2025-03-04 06:02:09,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:02:09,293 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;@290ff480, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:02:09,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 06:02:09,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 463 states, 437 states have (on average 1.6270022883295194) internal successors, (711), 454 states have internal predecessors, (711), 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-04 06:02:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 06:02:09,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:09,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:02:09,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:02:09,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:09,307 INFO L85 PathProgramCache]: Analyzing trace with hash 620726640, now seen corresponding path program 1 times [2025-03-04 06:02:09,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:09,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136504106] [2025-03-04 06:02:09,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:09,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:09,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 06:02:09,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 06:02:09,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:09,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:09,430 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-04 06:02:09,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:09,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136504106] [2025-03-04 06:02:09,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136504106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:09,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:09,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:02:09,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527549553] [2025-03-04 06:02:09,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:09,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:02:09,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:09,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:02:09,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:02:09,452 INFO L87 Difference]: Start difference. First operand has 463 states, 437 states have (on average 1.6270022883295194) internal successors, (711), 454 states have internal predecessors, (711), 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.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:02:09,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:09,569 INFO L93 Difference]: Finished difference Result 924 states and 1517 transitions. [2025-03-04 06:02:09,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:02:09,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 06:02:09,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:09,581 INFO L225 Difference]: With dead ends: 924 [2025-03-04 06:02:09,582 INFO L226 Difference]: Without dead ends: 426 [2025-03-04 06:02:09,587 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-04 06:02:09,592 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 636 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-04 06:02:09,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 636 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:02:09,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-04 06:02:09,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2025-03-04 06:02:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 401 states have (on average 1.4688279301745637) internal successors, (589), 417 states have internal predecessors, (589), 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-04 06:02:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 629 transitions. [2025-03-04 06:02:09,655 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 629 transitions. Word has length 9 [2025-03-04 06:02:09,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:09,656 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 629 transitions. [2025-03-04 06:02:09,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:02:09,657 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 629 transitions. [2025-03-04 06:02:09,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 06:02:09,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:09,659 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] [2025-03-04 06:02:09,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:02:09,659 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:02:09,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:09,660 INFO L85 PathProgramCache]: Analyzing trace with hash 296388285, now seen corresponding path program 1 times [2025-03-04 06:02:09,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:09,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263323085] [2025-03-04 06:02:09,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:09,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:09,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:02:09,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:02:09,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:09,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:10,059 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-04 06:02:10,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:10,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263323085] [2025-03-04 06:02:10,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263323085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:10,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:10,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:02:10,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648544360] [2025-03-04 06:02:10,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:10,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:02:10,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:10,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:02:10,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:02:10,061 INFO L87 Difference]: Start difference. First operand 426 states and 629 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:02:10,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:10,321 INFO L93 Difference]: Finished difference Result 1031 states and 1523 transitions. [2025-03-04 06:02:10,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:02:10,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-04 06:02:10,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:10,325 INFO L225 Difference]: With dead ends: 1031 [2025-03-04 06:02:10,325 INFO L226 Difference]: Without dead ends: 805 [2025-03-04 06:02:10,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:02:10,328 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 541 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1696 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-04 06:02:10,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1696 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:02:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-03-04 06:02:10,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 428. [2025-03-04 06:02:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 403 states have (on average 1.466501240694789) internal successors, (591), 419 states have internal predecessors, (591), 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-04 06:02:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 631 transitions. [2025-03-04 06:02:10,370 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 631 transitions. Word has length 62 [2025-03-04 06:02:10,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:10,370 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 631 transitions. [2025-03-04 06:02:10,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:02:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2025-03-04 06:02:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 06:02:10,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:10,374 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, 1] [2025-03-04 06:02:10,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:02:10,374 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:02:10,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:10,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1479029304, now seen corresponding path program 1 times [2025-03-04 06:02:10,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:10,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210626379] [2025-03-04 06:02:10,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:10,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:10,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 06:02:10,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 06:02:10,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:10,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:10,658 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-04 06:02:10,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:10,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210626379] [2025-03-04 06:02:10,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210626379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:10,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:10,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:02:10,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143222716] [2025-03-04 06:02:10,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:10,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:02:10,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:10,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:02:10,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:02:10,661 INFO L87 Difference]: Start difference. First operand 428 states and 631 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-04 06:02:10,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:10,794 INFO L93 Difference]: Finished difference Result 810 states and 1192 transitions. [2025-03-04 06:02:10,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:02:10,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 83 [2025-03-04 06:02:10,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:10,798 INFO L225 Difference]: With dead ends: 810 [2025-03-04 06:02:10,798 INFO L226 Difference]: Without dead ends: 386 [2025-03-04 06:02:10,798 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-04 06:02:10,799 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 30 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1466 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:10,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1466 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:02:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-04 06:02:10,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-03-04 06:02:10,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 361 states have (on average 1.4238227146814404) internal successors, (514), 377 states have internal predecessors, (514), 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-04 06:02:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 554 transitions. [2025-03-04 06:02:10,813 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 554 transitions. Word has length 83 [2025-03-04 06:02:10,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:10,813 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 554 transitions. [2025-03-04 06:02:10,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-04 06:02:10,814 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 554 transitions. [2025-03-04 06:02:10,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 06:02:10,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:10,815 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, 1] [2025-03-04 06:02:10,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:02:10,815 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:02:10,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:10,816 INFO L85 PathProgramCache]: Analyzing trace with hash -929024782, now seen corresponding path program 1 times [2025-03-04 06:02:10,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:10,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333395169] [2025-03-04 06:02:10,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:10,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:10,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 06:02:10,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 06:02:10,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:10,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:10,979 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-04 06:02:10,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:10,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333395169] [2025-03-04 06:02:10,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333395169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:10,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:10,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:02:10,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821642625] [2025-03-04 06:02:10,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:10,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:02:10,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:10,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:02:10,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:02:10,982 INFO L87 Difference]: Start difference. First operand 386 states and 554 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-04 06:02:11,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:11,136 INFO L93 Difference]: Finished difference Result 1016 states and 1462 transitions. [2025-03-04 06:02:11,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:02:11,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 83 [2025-03-04 06:02:11,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:11,139 INFO L225 Difference]: With dead ends: 1016 [2025-03-04 06:02:11,139 INFO L226 Difference]: Without dead ends: 634 [2025-03-04 06:02:11,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:02:11,140 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 293 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1171 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:11,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1171 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:02:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-03-04 06:02:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2025-03-04 06:02:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 605 states have (on average 1.431404958677686) internal successors, (866), 621 states have internal predecessors, (866), 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-04 06:02:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 908 transitions. [2025-03-04 06:02:11,160 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 908 transitions. Word has length 83 [2025-03-04 06:02:11,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:11,161 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 908 transitions. [2025-03-04 06:02:11,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-04 06:02:11,162 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 908 transitions. [2025-03-04 06:02:11,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 06:02:11,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:11,164 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-04 06:02:11,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:02:11,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:02:11,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:11,166 INFO L85 PathProgramCache]: Analyzing trace with hash 764968475, now seen corresponding path program 1 times [2025-03-04 06:02:11,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:11,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018576260] [2025-03-04 06:02:11,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:11,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:11,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:02:11,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:02:11,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:11,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:11,548 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-04 06:02:11,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:11,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018576260] [2025-03-04 06:02:11,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018576260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:02:11,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323778960] [2025-03-04 06:02:11,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:11,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:02:11,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:02:11,553 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-04 06:02:11,555 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-04 06:02:11,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:02:11,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:02:11,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:11,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:11,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 06:02:11,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:02:11,824 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-04 06:02:11,846 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-04 06:02:12,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:02:12,279 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-04 06:02:12,478 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-04 06:02:12,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:02:12,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323778960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:12,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:02:12,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 06:02:12,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420589584] [2025-03-04 06:02:12,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:12,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:02:12,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:12,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:02:12,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:02:12,482 INFO L87 Difference]: Start difference. First operand 631 states and 908 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) 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-04 06:02:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:13,442 INFO L93 Difference]: Finished difference Result 1515 states and 2181 transitions. [2025-03-04 06:02:13,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 06:02:13,443 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) 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-04 06:02:13,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:13,447 INFO L225 Difference]: With dead ends: 1515 [2025-03-04 06:02:13,447 INFO L226 Difference]: Without dead ends: 926 [2025-03-04 06:02:13,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-04 06:02:13,448 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 596 mSDsluCounter, 2260 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 2756 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:13,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 2756 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:02:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-03-04 06:02:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 631. [2025-03-04 06:02:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 605 states have (on average 1.4297520661157024) internal successors, (865), 621 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-04 06:02:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 907 transitions. [2025-03-04 06:02:13,467 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 907 transitions. Word has length 98 [2025-03-04 06:02:13,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:13,467 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 907 transitions. [2025-03-04 06:02:13,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) 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-04 06:02:13,467 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 907 transitions. [2025-03-04 06:02:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 06:02:13,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:13,468 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-04 06:02:13,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:02:13,669 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-04 06:02:13,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:02:13,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:13,671 INFO L85 PathProgramCache]: Analyzing trace with hash 730062964, now seen corresponding path program 1 times [2025-03-04 06:02:13,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:13,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109750972] [2025-03-04 06:02:13,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:13,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:13,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 06:02:13,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 06:02:13,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:13,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:14,033 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-04 06:02:14,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:14,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109750972] [2025-03-04 06:02:14,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109750972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:02:14,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901416368] [2025-03-04 06:02:14,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:14,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:02:14,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:02:14,037 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-04 06:02:14,039 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-04 06:02:14,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 06:02:14,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 06:02:14,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:14,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:14,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 06:02:14,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:02:14,281 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-04 06:02:14,295 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-04 06:02:14,992 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-04 06:02:14,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:02:14,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901416368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:14,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:02:14,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-03-04 06:02:14,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715559306] [2025-03-04 06:02:14,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:14,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 06:02:14,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:14,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 06:02:14,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-04 06:02:14,995 INFO L87 Difference]: Start difference. First operand 631 states and 907 transitions. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 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-04 06:02:16,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:16,300 INFO L93 Difference]: Finished difference Result 1530 states and 2201 transitions. [2025-03-04 06:02:16,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 06:02:16,300 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 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 99 [2025-03-04 06:02:16,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:16,304 INFO L225 Difference]: With dead ends: 1530 [2025-03-04 06:02:16,304 INFO L226 Difference]: Without dead ends: 946 [2025-03-04 06:02:16,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-04 06:02:16,306 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 648 mSDsluCounter, 2686 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 3178 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:16,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 3178 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 06:02:16,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-03-04 06:02:16,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 647. [2025-03-04 06:02:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 621 states have (on average 1.4251207729468598) internal successors, (885), 637 states have internal predecessors, (885), 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-04 06:02:16,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 927 transitions. [2025-03-04 06:02:16,326 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 927 transitions. Word has length 99 [2025-03-04 06:02:16,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:16,326 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 927 transitions. [2025-03-04 06:02:16,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 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-04 06:02:16,326 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 927 transitions. [2025-03-04 06:02:16,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 06:02:16,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:16,327 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-04 06:02:16,336 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-04 06:02:16,531 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-04 06:02:16,531 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:02:16,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:16,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1157423764, now seen corresponding path program 1 times [2025-03-04 06:02:16,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:16,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719240767] [2025-03-04 06:02:16,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:16,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:16,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 06:02:16,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 06:02:16,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:16,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:16,770 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-04 06:02:16,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:16,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719240767] [2025-03-04 06:02:16,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719240767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:16,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:16,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:02:16,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380313506] [2025-03-04 06:02:16,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:16,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:02:16,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:16,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:02:16,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:02:16,772 INFO L87 Difference]: Start difference. First operand 647 states and 927 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), 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-04 06:02:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:17,118 INFO L93 Difference]: Finished difference Result 1248 states and 1801 transitions. [2025-03-04 06:02:17,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:02:17,119 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), 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 100 [2025-03-04 06:02:17,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:17,121 INFO L225 Difference]: With dead ends: 1248 [2025-03-04 06:02:17,122 INFO L226 Difference]: Without dead ends: 657 [2025-03-04 06:02:17,123 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-04 06:02:17,125 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 14 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2684 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-04 06:02:17,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2684 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:02:17,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-03-04 06:02:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 655. [2025-03-04 06:02:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 629 states have (on average 1.4228934817170111) internal successors, (895), 645 states have internal predecessors, (895), 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-04 06:02:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 937 transitions. [2025-03-04 06:02:17,140 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 937 transitions. Word has length 100 [2025-03-04 06:02:17,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:17,140 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 937 transitions. [2025-03-04 06:02:17,141 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), 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-04 06:02:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 937 transitions. [2025-03-04 06:02:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 06:02:17,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:17,141 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-04 06:02:17,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:02:17,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:02:17,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:17,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1649321512, now seen corresponding path program 1 times [2025-03-04 06:02:17,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:17,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702597240] [2025-03-04 06:02:17,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:17,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:17,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 06:02:17,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 06:02:17,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:17,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:17,370 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-04 06:02:17,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:17,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702597240] [2025-03-04 06:02:17,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702597240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:17,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:17,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:02:17,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643382807] [2025-03-04 06:02:17,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:17,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:02:17,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:17,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:02:17,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:02:17,372 INFO L87 Difference]: Start difference. First operand 655 states and 937 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-04 06:02:17,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:17,640 INFO L93 Difference]: Finished difference Result 1263 states and 1821 transitions. [2025-03-04 06:02:17,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:02:17,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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 100 [2025-03-04 06:02:17,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:17,643 INFO L225 Difference]: With dead ends: 1263 [2025-03-04 06:02:17,643 INFO L226 Difference]: Without dead ends: 661 [2025-03-04 06:02:17,645 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-04 06:02:17,645 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 9 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2257 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:17,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2257 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:02:17,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-03-04 06:02:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2025-03-04 06:02:17,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 635 states have (on average 1.4188976377952756) internal successors, (901), 651 states have internal predecessors, (901), 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-04 06:02:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 943 transitions. [2025-03-04 06:02:17,665 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 943 transitions. Word has length 100 [2025-03-04 06:02:17,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:17,666 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 943 transitions. [2025-03-04 06:02:17,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-04 06:02:17,666 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 943 transitions. [2025-03-04 06:02:17,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 06:02:17,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:17,666 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] [2025-03-04 06:02:17,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:02:17,667 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:02:17,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:17,667 INFO L85 PathProgramCache]: Analyzing trace with hash -564871155, now seen corresponding path program 1 times [2025-03-04 06:02:17,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:17,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150032249] [2025-03-04 06:02:17,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:17,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:17,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 06:02:17,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 06:02:17,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:17,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:17,943 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-04 06:02:17,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:17,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150032249] [2025-03-04 06:02:17,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150032249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:02:17,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634890193] [2025-03-04 06:02:17,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:17,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:02:17,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:02:17,949 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-04 06:02:17,950 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-04 06:02:18,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 06:02:18,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 06:02:18,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:18,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:18,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 06:02:18,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:02:18,297 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-04 06:02:18,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:02:18,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634890193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:18,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:02:18,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-04 06:02:18,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953956544] [2025-03-04 06:02:18,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:18,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:02:18,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:18,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:02:18,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:02:18,299 INFO L87 Difference]: Start difference. First operand 661 states and 943 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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-04 06:02:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:18,609 INFO L93 Difference]: Finished difference Result 1279 states and 1838 transitions. [2025-03-04 06:02:18,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:02:18,610 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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 101 [2025-03-04 06:02:18,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:18,613 INFO L225 Difference]: With dead ends: 1279 [2025-03-04 06:02:18,613 INFO L226 Difference]: Without dead ends: 667 [2025-03-04 06:02:18,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 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-04 06:02:18,614 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 42 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 2705 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-04 06:02:18,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 2705 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:02:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-04 06:02:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 649. [2025-03-04 06:02:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 623 states have (on average 1.4173354735152488) internal successors, (883), 639 states have internal predecessors, (883), 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-04 06:02:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 925 transitions. [2025-03-04 06:02:18,630 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 925 transitions. Word has length 101 [2025-03-04 06:02:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:18,630 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 925 transitions. [2025-03-04 06:02:18,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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-04 06:02:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 925 transitions. [2025-03-04 06:02:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 06:02:18,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:18,631 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] [2025-03-04 06:02:18,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 06:02:18,831 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-04 06:02:18,832 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:02:18,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1469091366, now seen corresponding path program 1 times [2025-03-04 06:02:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:18,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590456522] [2025-03-04 06:02:18,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:18,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:18,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 06:02:18,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 06:02:18,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:18,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:19,097 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-04 06:02:19,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:19,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590456522] [2025-03-04 06:02:19,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590456522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:02:19,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216804720] [2025-03-04 06:02:19,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:19,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:02:19,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:02:19,100 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-04 06:02:19,102 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-04 06:02:19,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 06:02:19,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 06:02:19,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:19,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:19,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:02:19,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:02:28,370 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-04 06:02:28,371 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:02:28,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216804720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:28,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:02:28,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-04 06:02:28,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219156315] [2025-03-04 06:02:28,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:28,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:02:28,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:28,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:02:28,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:02:28,372 INFO L87 Difference]: Start difference. First operand 649 states and 925 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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-04 06:02:32,537 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-04 06:02:36,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 06:02:37,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 06:02:38,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 06:02:42,789 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-04 06:02:44,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 06:02:48,630 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 [0] [2025-03-04 06:02:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:49,715 INFO L93 Difference]: Finished difference Result 1247 states and 1793 transitions. [2025-03-04 06:02:49,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:02:49,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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 101 [2025-03-04 06:02:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:49,718 INFO L225 Difference]: With dead ends: 1247 [2025-03-04 06:02:49,718 INFO L226 Difference]: Without dead ends: 659 [2025-03-04 06:02:49,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:02:49,719 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 12 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:49,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2690 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 571 Invalid, 4 Unknown, 0 Unchecked, 21.3s Time] [2025-03-04 06:02:49,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-04 06:02:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 649. [2025-03-04 06:02:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 623 states have (on average 1.4173354735152488) internal successors, (883), 639 states have internal predecessors, (883), 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-04 06:02:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 925 transitions. [2025-03-04 06:02:49,735 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 925 transitions. Word has length 101 [2025-03-04 06:02:49,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:49,735 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 925 transitions. [2025-03-04 06:02:49,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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-04 06:02:49,735 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 925 transitions. [2025-03-04 06:02:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 06:02:49,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:49,736 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, 1] [2025-03-04 06:02:49,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 06:02:49,936 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-04 06:02:49,937 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:02:49,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:49,937 INFO L85 PathProgramCache]: Analyzing trace with hash -469853271, now seen corresponding path program 1 times [2025-03-04 06:02:49,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:49,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785465704] [2025-03-04 06:02:49,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:49,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:49,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 06:02:49,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 06:02:49,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:49,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:50,272 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-04 06:02:50,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:50,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785465704] [2025-03-04 06:02:50,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785465704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:50,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:50,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:02:50,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966804305] [2025-03-04 06:02:50,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:50,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:02:50,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:50,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:02:50,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:02:50,274 INFO L87 Difference]: Start difference. First operand 649 states and 925 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), 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-04 06:02:50,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:50,825 INFO L93 Difference]: Finished difference Result 1269 states and 1822 transitions. [2025-03-04 06:02:50,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:02:50,826 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), 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 103 [2025-03-04 06:02:50,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:50,829 INFO L225 Difference]: With dead ends: 1269 [2025-03-04 06:02:50,829 INFO L226 Difference]: Without dead ends: 681 [2025-03-04 06:02:50,830 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-04 06:02:50,831 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 23 mSDsluCounter, 3143 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3644 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:50,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3644 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:02:50,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-04 06:02:50,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 669. [2025-03-04 06:02:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 643 states have (on average 1.4105754276827371) internal successors, (907), 659 states have internal predecessors, (907), 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-04 06:02:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 949 transitions. [2025-03-04 06:02:50,847 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 949 transitions. Word has length 103 [2025-03-04 06:02:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:50,847 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 949 transitions. [2025-03-04 06:02:50,847 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), 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-04 06:02:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 949 transitions. [2025-03-04 06:02:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 06:02:50,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:50,849 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, 1] [2025-03-04 06:02:50,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:02:50,849 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:02:50,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:50,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1726070397, now seen corresponding path program 1 times [2025-03-04 06:02:50,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:50,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423294446] [2025-03-04 06:02:50,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:50,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:50,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 06:02:50,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 06:02:50,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:50,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:51,039 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-04 06:02:51,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:51,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423294446] [2025-03-04 06:02:51,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423294446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:02:51,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935049361] [2025-03-04 06:02:51,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:51,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:02:51,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:02:51,042 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-04 06:02:51,043 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-04 06:02:51,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 06:02:51,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 06:02:51,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:51,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:51,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 06:02:51,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:02:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:02:51,393 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:02:51,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935049361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:51,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:02:51,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-04 06:02:51,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082796665] [2025-03-04 06:02:51,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:51,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:02:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:51,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:02:51,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:02:51,395 INFO L87 Difference]: Start difference. First operand 669 states and 949 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 06:02:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:51,490 INFO L93 Difference]: Finished difference Result 1233 states and 1764 transitions. [2025-03-04 06:02:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:02:51,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2025-03-04 06:02:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:51,494 INFO L225 Difference]: With dead ends: 1233 [2025-03-04 06:02:51,495 INFO L226 Difference]: Without dead ends: 672 [2025-03-04 06:02:51,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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-04 06:02:51,497 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 0 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1523 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-04 06:02:51,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1523 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:02:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-04 06:02:51,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2025-03-04 06:02:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 645 states have (on average 1.4108527131782946) internal successors, (910), 662 states have internal predecessors, (910), 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-04 06:02:51,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 953 transitions. [2025-03-04 06:02:51,514 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 953 transitions. Word has length 103 [2025-03-04 06:02:51,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:51,514 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 953 transitions. [2025-03-04 06:02:51,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 06:02:51,515 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 953 transitions. [2025-03-04 06:02:51,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 06:02:51,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:51,518 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-04 06:02:51,528 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-04 06:02:51,718 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-04 06:02:51,719 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:02:51,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:51,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1963291193, now seen corresponding path program 1 times [2025-03-04 06:02:51,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:51,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579602732] [2025-03-04 06:02:51,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:51,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:51,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 06:02:51,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 06:02:51,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:51,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:51,959 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-04 06:02:51,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:51,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579602732] [2025-03-04 06:02:51,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579602732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:02:51,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804982987] [2025-03-04 06:02:51,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:51,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:02:51,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:02:51,961 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-04 06:02:51,963 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-04 06:02:52,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 06:02:52,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 06:02:52,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:52,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:52,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 06:02:52,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:02:52,283 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-04 06:02:52,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:02:52,354 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-04 06:02:52,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804982987] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:02:52,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:02:52,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:02:52,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390676637] [2025-03-04 06:02:52,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:02:52,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:02:52,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:52,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:02:52,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:02:52,356 INFO L87 Difference]: Start difference. First operand 672 states and 953 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-04 06:02:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:52,623 INFO L93 Difference]: Finished difference Result 1249 states and 1787 transitions. [2025-03-04 06:02:52,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 06:02:52,623 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-04 06:02:52,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:52,626 INFO L225 Difference]: With dead ends: 1249 [2025-03-04 06:02:52,626 INFO L226 Difference]: Without dead ends: 683 [2025-03-04 06:02:52,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-04 06:02:52,628 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 11 mSDsluCounter, 3026 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3535 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:52,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3535 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:02:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-04 06:02:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2025-03-04 06:02:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 653 states have (on average 1.4119448698315467) internal successors, (922), 670 states have internal predecessors, (922), 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-04 06:02:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 965 transitions. [2025-03-04 06:02:52,648 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 965 transitions. Word has length 105 [2025-03-04 06:02:52,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:52,648 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 965 transitions. [2025-03-04 06:02:52,648 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-04 06:02:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 965 transitions. [2025-03-04 06:02:52,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 06:02:52,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:52,651 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-04 06:02:52,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 06:02:52,851 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-04 06:02:52,852 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:02:52,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1035994115, now seen corresponding path program 2 times [2025-03-04 06:02:52,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:52,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301053177] [2025-03-04 06:02:52,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:02:52,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:52,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-04 06:02:52,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 96 of 109 statements. [2025-03-04 06:02:52,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:02:52,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:53,059 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-04 06:02:53,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:53,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301053177] [2025-03-04 06:02:53,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301053177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:53,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:53,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:02:53,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657581870] [2025-03-04 06:02:53,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:53,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:02:53,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:53,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:02:53,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:02:53,061 INFO L87 Difference]: Start difference. First operand 681 states and 965 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-04 06:02:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:53,489 INFO L93 Difference]: Finished difference Result 1299 states and 1858 transitions. [2025-03-04 06:02:53,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:02:53,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-04 06:02:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:53,492 INFO L225 Difference]: With dead ends: 1299 [2025-03-04 06:02:53,493 INFO L226 Difference]: Without dead ends: 687 [2025-03-04 06:02:53,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-04 06:02:53,494 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 8 mSDsluCounter, 2175 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2674 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-04 06:02:53,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2674 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:02:53,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-04 06:02:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2025-03-04 06:02:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 659 states have (on average 1.4081942336874052) internal successors, (928), 676 states have internal predecessors, (928), 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-04 06:02:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 971 transitions. [2025-03-04 06:02:53,509 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 971 transitions. Word has length 109 [2025-03-04 06:02:53,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:53,509 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 971 transitions. [2025-03-04 06:02:53,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-04 06:02:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 971 transitions. [2025-03-04 06:02:53,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 06:02:53,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:53,510 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-04 06:02:53,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:02:53,510 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:02:53,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:53,511 INFO L85 PathProgramCache]: Analyzing trace with hash -322515937, now seen corresponding path program 1 times [2025-03-04 06:02:53,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:53,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071534976] [2025-03-04 06:02:53,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:53,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:53,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 06:02:53,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 06:02:53,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:53,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:53,810 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-04 06:02:53,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:53,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071534976] [2025-03-04 06:02:53,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071534976] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:02:53,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3641668] [2025-03-04 06:02:53,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:53,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:02:53,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:02:53,813 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-04 06:02:53,814 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-04 06:02:54,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 06:02:54,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 06:02:54,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:54,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:54,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 06:02:54,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:02:54,246 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-04 06:02:54,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:02:54,352 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-04 06:02:54,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3641668] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:02:54,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:02:54,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2025-03-04 06:02:54,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497528442] [2025-03-04 06:02:54,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:02:54,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 06:02:54,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:54,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 06:02:54,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:02:54,353 INFO L87 Difference]: Start difference. First operand 687 states and 971 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-04 06:02:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:54,734 INFO L93 Difference]: Finished difference Result 1273 states and 1813 transitions. [2025-03-04 06:02:54,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 06:02:54,735 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-04 06:02:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:54,737 INFO L225 Difference]: With dead ends: 1273 [2025-03-04 06:02:54,737 INFO L226 Difference]: Without dead ends: 691 [2025-03-04 06:02:54,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2025-03-04 06:02:54,738 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 28 mSDsluCounter, 3946 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4445 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:54,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4445 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:02:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-03-04 06:02:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2025-03-04 06:02:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 663 states have (on average 1.4042232277526394) internal successors, (931), 680 states have internal predecessors, (931), 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-04 06:02:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 974 transitions. [2025-03-04 06:02:54,756 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 974 transitions. Word has length 109 [2025-03-04 06:02:54,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:54,757 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 974 transitions. [2025-03-04 06:02:54,757 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-04 06:02:54,757 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 974 transitions. [2025-03-04 06:02:54,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 06:02:54,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:54,757 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-04 06:02:54,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 06:02:54,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:02:54,962 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:02:54,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:54,962 INFO L85 PathProgramCache]: Analyzing trace with hash 507993887, now seen corresponding path program 2 times [2025-03-04 06:02:54,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:54,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420251721] [2025-03-04 06:02:54,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:02:54,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:54,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-03-04 06:02:55,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 96 of 113 statements. [2025-03-04 06:02:55,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:02:55,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:55,234 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-04 06:02:55,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:55,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420251721] [2025-03-04 06:02:55,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420251721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:02:55,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:02:55,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:02:55,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86716821] [2025-03-04 06:02:55,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:02:55,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:02:55,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:02:55,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:02:55,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:02:55,236 INFO L87 Difference]: Start difference. First operand 691 states and 974 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-04 06:02:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:02:55,748 INFO L93 Difference]: Finished difference Result 1332 states and 1892 transitions. [2025-03-04 06:02:55,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:02:55,749 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 113 [2025-03-04 06:02:55,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:02:55,751 INFO L225 Difference]: With dead ends: 1332 [2025-03-04 06:02:55,751 INFO L226 Difference]: Without dead ends: 725 [2025-03-04 06:02:55,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-04 06:02:55,752 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 17 mSDsluCounter, 3548 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4036 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:02:55,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4036 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:02:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-03-04 06:02:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 701. [2025-03-04 06:02:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 673 states have (on average 1.401188707280832) internal successors, (943), 690 states have internal predecessors, (943), 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-04 06:02:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 986 transitions. [2025-03-04 06:02:55,769 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 986 transitions. Word has length 113 [2025-03-04 06:02:55,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:02:55,769 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 986 transitions. [2025-03-04 06:02:55,769 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-04 06:02:55,769 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 986 transitions. [2025-03-04 06:02:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 06:02:55,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:02:55,770 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, 1] [2025-03-04 06:02:55,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:02:55,770 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:02:55,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:02:55,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1787605907, now seen corresponding path program 1 times [2025-03-04 06:02:55,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:02:55,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052109322] [2025-03-04 06:02:55,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:55,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:02:55,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 06:02:55,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:02:55,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:55,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 06:02:56,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:02:56,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052109322] [2025-03-04 06:02:56,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052109322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:02:56,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187167937] [2025-03-04 06:02:56,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:02:56,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:02:56,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:02:56,168 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-04 06:02:56,170 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-04 06:02:56,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 06:02:56,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:02:56,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:02:56,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:02:56,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 06:02:56,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:02:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 18 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 06:02:56,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:03:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 37 proven. 9 refuted. 1 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 06:03:00,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187167937] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:03:00,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:03:00,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 23 [2025-03-04 06:03:00,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621748747] [2025-03-04 06:03:00,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:03:00,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 06:03:00,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:03:00,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 06:03:00,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=371, Unknown=1, NotChecked=0, Total=506 [2025-03-04 06:03:00,859 INFO L87 Difference]: Start difference. First operand 701 states and 986 transitions. Second operand has 23 states, 23 states have (on average 5.391304347826087) internal successors, (124), 23 states have internal predecessors, (124), 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-04 06:03:01,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:03:01,556 INFO L93 Difference]: Finished difference Result 1305 states and 1854 transitions. [2025-03-04 06:03:01,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 06:03:01,557 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.391304347826087) internal successors, (124), 23 states have internal predecessors, (124), 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 114 [2025-03-04 06:03:01,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:03:01,559 INFO L225 Difference]: With dead ends: 1305 [2025-03-04 06:03:01,561 INFO L226 Difference]: Without dead ends: 714 [2025-03-04 06:03:01,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=328, Invalid=793, Unknown=1, NotChecked=0, Total=1122 [2025-03-04 06:03:01,562 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 32 mSDsluCounter, 4452 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4951 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:03:01,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4951 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:03:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-04 06:03:01,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 710. [2025-03-04 06:03:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 682 states have (on average 1.404692082111437) internal successors, (958), 699 states have internal predecessors, (958), 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-04 06:03:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1001 transitions. [2025-03-04 06:03:01,579 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1001 transitions. Word has length 114 [2025-03-04 06:03:01,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:03:01,580 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1001 transitions. [2025-03-04 06:03:01,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.391304347826087) internal successors, (124), 23 states have internal predecessors, (124), 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-04 06:03:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1001 transitions. [2025-03-04 06:03:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 06:03:01,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:03:01,581 INFO L218 NwaCegarLoop]: trace histogram [19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:03:01,591 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-04 06:03:01,781 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,SelfDestructingSolverStorable16 [2025-03-04 06:03:01,781 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:03:01,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:03:01,782 INFO L85 PathProgramCache]: Analyzing trace with hash -980408585, now seen corresponding path program 2 times [2025-03-04 06:03:01,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:03:01,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686823368] [2025-03-04 06:03:01,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:03:01,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:03:01,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-03-04 06:03:01,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 97 of 123 statements. [2025-03-04 06:03:01,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:03:01,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:03:02,130 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2025-03-04 06:03:02,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:03:02,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686823368] [2025-03-04 06:03:02,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686823368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:03:02,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:03:02,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:03:02,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027682490] [2025-03-04 06:03:02,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:03:02,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:03:02,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:03:02,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:03:02,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:03:02,132 INFO L87 Difference]: Start difference. First operand 710 states and 1001 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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-04 06:03:04,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 06:03:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:03:04,829 INFO L93 Difference]: Finished difference Result 1355 states and 1928 transitions. [2025-03-04 06:03:04,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:03:04,830 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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 123 [2025-03-04 06:03:04,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:03:04,833 INFO L225 Difference]: With dead ends: 1355 [2025-03-04 06:03:04,833 INFO L226 Difference]: Without dead ends: 734 [2025-03-04 06:03:04,834 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-04 06:03:04,847 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 13 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3608 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:03:04,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3608 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-04 06:03:04,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-04 06:03:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 718. [2025-03-04 06:03:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 690 states have (on average 1.4028985507246376) internal successors, (968), 707 states have internal predecessors, (968), 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-04 06:03:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1011 transitions. [2025-03-04 06:03:04,878 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1011 transitions. Word has length 123 [2025-03-04 06:03:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:03:04,878 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1011 transitions. [2025-03-04 06:03:04,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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-04 06:03:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1011 transitions. [2025-03-04 06:03:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 06:03:04,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:03:04,879 INFO L218 NwaCegarLoop]: trace histogram [19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:03:04,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:03:04,879 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:03:04,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:03:04,879 INFO L85 PathProgramCache]: Analyzing trace with hash -219715970, now seen corresponding path program 1 times [2025-03-04 06:03:04,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:03:04,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901487543] [2025-03-04 06:03:04,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:03:04,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:03:04,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 06:03:05,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 06:03:05,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:03:05,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:03:05,544 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-04 06:03:05,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:03:05,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901487543] [2025-03-04 06:03:05,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901487543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:03:05,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840112583] [2025-03-04 06:03:05,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:03:05,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:03:05,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:03:05,548 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-04 06:03:05,549 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-04 06:03:05,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 06:03:06,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 06:03:06,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:03:06,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:03:06,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 06:03:06,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:03:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 107 proven. 28 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-04 06:03:07,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:03:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 128 refuted. 6 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-04 06:03:31,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840112583] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:03:31,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:03:31,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-04 06:03:31,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528028266] [2025-03-04 06:03:31,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:03:31,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 06:03:31,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:03:31,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 06:03:31,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=474, Unknown=6, NotChecked=0, Total=702 [2025-03-04 06:03:31,410 INFO L87 Difference]: Start difference. First operand 718 states and 1011 transitions. Second operand has 27 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 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-04 06:03:32,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:03:32,831 INFO L93 Difference]: Finished difference Result 1331 states and 1892 transitions. [2025-03-04 06:03:32,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 06:03:32,832 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 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 123 [2025-03-04 06:03:32,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:03:32,835 INFO L225 Difference]: With dead ends: 1331 [2025-03-04 06:03:32,835 INFO L226 Difference]: Without dead ends: 727 [2025-03-04 06:03:32,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=619, Invalid=1097, Unknown=6, NotChecked=0, Total=1722 [2025-03-04 06:03:32,836 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 11 mSDsluCounter, 4065 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4575 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:03:32,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4575 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:03:32,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-03-04 06:03:32,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2025-03-04 06:03:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 699 states have (on average 1.396280400572246) internal successors, (976), 716 states have internal predecessors, (976), 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-04 06:03:32,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1019 transitions. [2025-03-04 06:03:32,854 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1019 transitions. Word has length 123 [2025-03-04 06:03:32,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:03:32,854 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1019 transitions. [2025-03-04 06:03:32,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 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-04 06:03:32,854 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1019 transitions. [2025-03-04 06:03:32,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 06:03:32,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:03:32,855 INFO L218 NwaCegarLoop]: trace histogram [28, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:03:32,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 06:03:33,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:03:33,057 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:03:33,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:03:33,058 INFO L85 PathProgramCache]: Analyzing trace with hash -943296916, now seen corresponding path program 2 times [2025-03-04 06:03:33,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:03:33,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818828602] [2025-03-04 06:03:33,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:03:33,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:03:33,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 132 statements into 2 equivalence classes. [2025-03-04 06:03:33,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 97 of 132 statements. [2025-03-04 06:03:33,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:03:33,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat