./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-40.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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-40.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 635d22826d94d730e7ad3ae4f19cd66841ae17da2d3a120d8f593801b41e2197 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:28:15,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:28:15,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:28:15,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:28:15,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:28:15,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:28:15,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:28:15,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:28:15,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:28:15,580 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:28:15,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:28:15,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:28:15,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:28:15,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:28:15,581 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:28:15,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:28:15,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:28:15,582 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:28:15,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:28:15,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:28:15,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:28:15,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:28:15,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:28:15,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:28:15,583 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:28:15,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:28:15,583 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:28:15,583 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:28:15,583 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:28:15,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:28:15,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:28:15,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:28:15,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:28:15,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:28:15,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:28:15,584 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:28:15,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:28:15,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:28:15,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:28:15,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:28:15,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:28:15,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:28:15,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:28:15,585 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 -> 635d22826d94d730e7ad3ae4f19cd66841ae17da2d3a120d8f593801b41e2197 [2025-03-04 01:28:15,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:28:15,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:28:15,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:28:15,823 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:28:15,823 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:28:15,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-40.i [2025-03-04 01:28:16,994 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa997e9d/36232d679b0841c89123206b1140a3be/FLAG3d6b17ddd [2025-03-04 01:28:17,286 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:28:17,286 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-40.i [2025-03-04 01:28:17,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa997e9d/36232d679b0841c89123206b1140a3be/FLAG3d6b17ddd [2025-03-04 01:28:17,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa997e9d/36232d679b0841c89123206b1140a3be [2025-03-04 01:28:17,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:28:17,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:28:17,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:28:17,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:28:17,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:28:17,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:28:17" (1/1) ... [2025-03-04 01:28:17,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ea8090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:17, skipping insertion in model container [2025-03-04 01:28:17,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:28:17" (1/1) ... [2025-03-04 01:28:17,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:28:17,426 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-40.i[916,929] [2025-03-04 01:28:17,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:28:17,488 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:28:17,498 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-40.i[916,929] [2025-03-04 01:28:17,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:28:17,551 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:28:17,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:17 WrapperNode [2025-03-04 01:28:17,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:28:17,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:28:17,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:28:17,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:28:17,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:17" (1/1) ... [2025-03-04 01:28:17,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:17" (1/1) ... [2025-03-04 01:28:17,608 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 506 [2025-03-04 01:28:17,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:28:17,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:28:17,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:28:17,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:28:17,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:17" (1/1) ... [2025-03-04 01:28:17,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:17" (1/1) ... [2025-03-04 01:28:17,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:17" (1/1) ... [2025-03-04 01:28:17,653 INFO L175 MemorySlicer]: Split 120 memory accesses to 17 slices as follows [2, 3, 6, 10, 5, 7, 7, 6, 8, 4, 10, 9, 8, 10, 15, 3, 7]. 13 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-03-04 01:28:17,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:17" (1/1) ... [2025-03-04 01:28:17,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:17" (1/1) ... [2025-03-04 01:28:17,670 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:17" (1/1) ... [2025-03-04 01:28:17,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:17" (1/1) ... [2025-03-04 01:28:17,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:17" (1/1) ... [2025-03-04 01:28:17,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:17" (1/1) ... [2025-03-04 01:28:17,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:28:17,692 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:28:17,692 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:28:17,692 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:28:17,696 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:17" (1/1) ... [2025-03-04 01:28:17,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:28:17,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:28:17,724 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 01:28:17,726 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 01:28:17,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:28:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:28:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:28:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:28:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:28:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:28:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:28:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 01:28:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-04 01:28:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-04 01:28:17,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-04 01:28:17,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-04 01:28:17,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-03-04 01:28:17,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-03-04 01:28:17,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-03-04 01:28:17,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-03-04 01:28:17,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2025-03-04 01:28:17,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2025-03-04 01:28:17,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:28:17,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:28:17,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:28:17,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:28:17,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:28:17,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:28:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:28:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 01:28:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 01:28:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 01:28:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 01:28:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 01:28:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 01:28:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 01:28:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 01:28:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 01:28:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 01:28:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:28:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:28:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:28:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:28:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:28:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:28:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-04 01:28:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-04 01:28:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-04 01:28:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2025-03-04 01:28:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:28:17,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 01:28:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:28:17,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:28:17,912 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:28:17,913 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:28:18,301 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L116: havoc property_#t~mem70#1;havoc property_#t~ite82#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~short73#1;havoc property_#t~ite81#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~bitwise88#1;havoc property_#t~ite94#1;havoc property_#t~mem91#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~short95#1;havoc property_#t~mem99#1;havoc property_#t~mem96#1;havoc property_#t~ite98#1;havoc property_#t~mem97#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~ite109#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~short112#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~short115#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1; [2025-03-04 01:28:18,341 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-04 01:28:18,342 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:28:18,358 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:28:18,359 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:28:18,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:28:18 BoogieIcfgContainer [2025-03-04 01:28:18,359 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:28:18,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:28:18,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:28:18,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:28:18,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:28:17" (1/3) ... [2025-03-04 01:28:18,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c53b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:28:18, skipping insertion in model container [2025-03-04 01:28:18,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:17" (2/3) ... [2025-03-04 01:28:18,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c53b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:28:18, skipping insertion in model container [2025-03-04 01:28:18,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:28:18" (3/3) ... [2025-03-04 01:28:18,367 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-40.i [2025-03-04 01:28:18,377 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:28:18,379 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-40.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:28:18,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:28:18,438 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;@75c93016, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:28:18,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:28:18,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:28:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:28:18,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:18,465 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:28:18,466 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:18,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash -848060979, now seen corresponding path program 1 times [2025-03-04 01:28:18,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:18,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777907077] [2025-03-04 01:28:18,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:18,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:18,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:28:18,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:28:18,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:18,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 01:28:18,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:18,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777907077] [2025-03-04 01:28:18,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777907077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:28:18,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345610578] [2025-03-04 01:28:18,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:18,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:18,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:28:18,817 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 01:28:18,819 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 01:28:18,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:28:19,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:28:19,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:19,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:19,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:28:19,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 01:28:19,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:28:19,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345610578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:19,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:28:19,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:28:19,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272736019] [2025-03-04 01:28:19,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:19,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:28:19,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:19,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:28:19,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:28:19,146 INFO L87 Difference]: Start difference. First operand has 112 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:28:19,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:19,170 INFO L93 Difference]: Finished difference Result 218 states and 344 transitions. [2025-03-04 01:28:19,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:28:19,173 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2025-03-04 01:28:19,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:19,179 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:28:19,180 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 01:28:19,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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 01:28:19,186 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:19,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:28:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 01:28:19,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-04 01:28:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:28:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2025-03-04 01:28:19,223 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 150 [2025-03-04 01:28:19,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:19,223 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2025-03-04 01:28:19,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:28:19,224 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2025-03-04 01:28:19,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:28:19,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:19,229 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:28:19,239 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 01:28:19,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:28:19,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:19,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:19,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1732066422, now seen corresponding path program 1 times [2025-03-04 01:28:19,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:19,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016182329] [2025-03-04 01:28:19,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:19,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:19,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:28:19,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:28:19,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:19,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:19,873 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:28:19,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:19,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016182329] [2025-03-04 01:28:19,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016182329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:28:19,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574315176] [2025-03-04 01:28:19,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:19,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:19,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:28:19,876 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 01:28:19,878 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 01:28:20,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:28:20,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:28:20,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:20,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:20,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:28:20,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:28:20,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:28:20,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574315176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:20,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:28:20,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:28:20,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536484692] [2025-03-04 01:28:20,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:20,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:28:20,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:20,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:28:20,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:28:20,173 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:28:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:20,214 INFO L93 Difference]: Finished difference Result 218 states and 321 transitions. [2025-03-04 01:28:20,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:28:20,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-03-04 01:28:20,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:20,217 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:28:20,217 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 01:28:20,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:28:20,219 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:20,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 454 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:28:20,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 01:28:20,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-03-04 01:28:20,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:28:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 162 transitions. [2025-03-04 01:28:20,227 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 162 transitions. Word has length 150 [2025-03-04 01:28:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:20,228 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 162 transitions. [2025-03-04 01:28:20,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:28:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 162 transitions. [2025-03-04 01:28:20,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:28:20,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:20,230 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:28:20,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:28:20,434 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,SelfDestructingSolverStorable1 [2025-03-04 01:28:20,434 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:20,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:20,434 INFO L85 PathProgramCache]: Analyzing trace with hash -75388041, now seen corresponding path program 1 times [2025-03-04 01:28:20,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:20,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360232327] [2025-03-04 01:28:20,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:20,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:20,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:28:20,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:28:20,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:20,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:28:20,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:20,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360232327] [2025-03-04 01:28:20,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360232327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:28:20,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271732236] [2025-03-04 01:28:20,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:20,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:20,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:28:20,691 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 01:28:20,694 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 01:28:20,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:28:20,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:28:20,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:20,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:20,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:28:20,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:28:20,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:28:20,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271732236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:20,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:28:20,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:28:20,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689457039] [2025-03-04 01:28:20,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:20,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:28:20,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:20,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:28:20,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:28:20,945 INFO L87 Difference]: Start difference. First operand 111 states and 162 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:28:20,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:20,979 INFO L93 Difference]: Finished difference Result 222 states and 325 transitions. [2025-03-04 01:28:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:28:20,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-03-04 01:28:20,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:20,984 INFO L225 Difference]: With dead ends: 222 [2025-03-04 01:28:20,984 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 01:28:20,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:28:20,985 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:20,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 455 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:28:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 01:28:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-04 01:28:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:28:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2025-03-04 01:28:20,992 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 150 [2025-03-04 01:28:20,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:20,993 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2025-03-04 01:28:20,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:28:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2025-03-04 01:28:20,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:28:20,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:20,996 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:28:21,002 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 01:28:21,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:21,200 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:21,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash 812115640, now seen corresponding path program 1 times [2025-03-04 01:28:21,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:21,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334589231] [2025-03-04 01:28:21,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:21,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:28:21,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:28:21,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:21,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:28:21,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:21,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334589231] [2025-03-04 01:28:21,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334589231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:28:21,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47347967] [2025-03-04 01:28:21,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:21,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:21,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:28:21,404 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 01:28:21,406 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 01:28:21,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:28:21,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:28:21,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:21,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:21,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:28:21,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:28:21,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:28:21,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47347967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:21,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:28:21,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:28:21,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445737675] [2025-03-04 01:28:21,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:21,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:28:21,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:21,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:28:21,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:28:21,670 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:28:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:21,698 INFO L93 Difference]: Finished difference Result 226 states and 329 transitions. [2025-03-04 01:28:21,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:28:21,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-03-04 01:28:21,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:21,700 INFO L225 Difference]: With dead ends: 226 [2025-03-04 01:28:21,700 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:28:21,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:28:21,701 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:21,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 457 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:28:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:28:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-04 01:28:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:28:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 166 transitions. [2025-03-04 01:28:21,707 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 166 transitions. Word has length 150 [2025-03-04 01:28:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:21,707 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 166 transitions. [2025-03-04 01:28:21,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:28:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 166 transitions. [2025-03-04 01:28:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:28:21,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:21,709 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:28:21,716 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 01:28:21,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:21,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:21,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:21,910 INFO L85 PathProgramCache]: Analyzing trace with hash 813039161, now seen corresponding path program 1 times [2025-03-04 01:28:21,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:21,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188818957] [2025-03-04 01:28:21,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:21,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:21,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:28:21,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:28:21,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:21,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:28:22,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:22,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188818957] [2025-03-04 01:28:22,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188818957] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:28:22,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978567120] [2025-03-04 01:28:22,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:22,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:22,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:28:22,116 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 01:28:22,117 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 01:28:22,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:28:22,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:28:22,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:22,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:22,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:28:22,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:28:22,388 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:28:22,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978567120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:22,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:28:22,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:28:22,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362169194] [2025-03-04 01:28:22,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:22,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:28:22,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:22,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:28:22,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:28:22,389 INFO L87 Difference]: Start difference. First operand 115 states and 166 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:28:22,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:22,419 INFO L93 Difference]: Finished difference Result 229 states and 332 transitions. [2025-03-04 01:28:22,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:28:22,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-03-04 01:28:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:22,422 INFO L225 Difference]: With dead ends: 229 [2025-03-04 01:28:22,422 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 01:28:22,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:28:22,424 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:22,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 457 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:28:22,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 01:28:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-04 01:28:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 96 states have internal predecessors, (130), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:28:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 168 transitions. [2025-03-04 01:28:22,433 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 168 transitions. Word has length 150 [2025-03-04 01:28:22,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:22,433 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 168 transitions. [2025-03-04 01:28:22,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:28:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 168 transitions. [2025-03-04 01:28:22,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:28:22,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:22,435 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:28:22,443 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 01:28:22,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:22,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:22,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:22,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1860729676, now seen corresponding path program 1 times [2025-03-04 01:28:22,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:22,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398356262] [2025-03-04 01:28:22,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:22,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:22,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:28:22,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:28:22,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:22,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:28:22,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:22,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398356262] [2025-03-04 01:28:22,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398356262] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:28:22,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26937559] [2025-03-04 01:28:22,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:22,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:22,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:28:22,836 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 01:28:22,837 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 01:28:22,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:28:23,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:28:23,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:23,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:23,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:28:23,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:28:23,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:28:23,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26937559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:23,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:28:23,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:28:23,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270375016] [2025-03-04 01:28:23,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:23,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:28:23,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:23,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:28:23,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:28:23,073 INFO L87 Difference]: Start difference. First operand 117 states and 168 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:28:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:23,102 INFO L93 Difference]: Finished difference Result 234 states and 337 transitions. [2025-03-04 01:28:23,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:28:23,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:28:23,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:23,104 INFO L225 Difference]: With dead ends: 234 [2025-03-04 01:28:23,104 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 01:28:23,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:28:23,105 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:23,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 605 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:28:23,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 01:28:23,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2025-03-04 01:28:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:28:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 169 transitions. [2025-03-04 01:28:23,110 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 169 transitions. Word has length 153 [2025-03-04 01:28:23,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:23,111 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 169 transitions. [2025-03-04 01:28:23,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:28:23,111 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 169 transitions. [2025-03-04 01:28:23,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:28:23,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:23,112 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:28:23,119 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 01:28:23,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:23,312 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:23,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:23,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1285543549, now seen corresponding path program 1 times [2025-03-04 01:28:23,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:23,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154985920] [2025-03-04 01:28:23,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:23,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:23,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:28:23,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:28:23,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:23,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:28:23,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:23,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154985920] [2025-03-04 01:28:23,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154985920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:23,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:28:23,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:28:23,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506316233] [2025-03-04 01:28:23,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:23,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:28:23,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:23,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:28:23,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:28:23,837 INFO L87 Difference]: Start difference. First operand 118 states and 169 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:28:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:23,938 INFO L93 Difference]: Finished difference Result 313 states and 445 transitions. [2025-03-04 01:28:23,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:28:23,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:28:23,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:23,940 INFO L225 Difference]: With dead ends: 313 [2025-03-04 01:28:23,940 INFO L226 Difference]: Without dead ends: 198 [2025-03-04 01:28:23,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:28:23,941 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 91 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:23,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 882 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:28:23,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-04 01:28:23,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2025-03-04 01:28:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 163 states have (on average 1.3374233128834356) internal successors, (218), 164 states have internal predecessors, (218), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 01:28:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 276 transitions. [2025-03-04 01:28:23,958 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 276 transitions. Word has length 153 [2025-03-04 01:28:23,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:23,959 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 276 transitions. [2025-03-04 01:28:23,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:28:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 276 transitions. [2025-03-04 01:28:23,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:28:23,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:23,960 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:28:23,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:28:23,960 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:23,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:23,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1796077726, now seen corresponding path program 1 times [2025-03-04 01:28:23,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:23,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519707903] [2025-03-04 01:28:23,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:23,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:23,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:28:24,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:28:24,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:24,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat