./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-4.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-sp_file-4.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 4714a0c6536056117a4ee0063fda0c81448928e693130365c60e5088462281df --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:50:35,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:50:35,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:50:35,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:50:35,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:50:35,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:50:35,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:50:35,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:50:35,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:50:35,677 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:50:35,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:50:35,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:50:35,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:50:35,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:50:35,678 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:50:35,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:50:35,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:50:35,679 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:50:35,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:50:35,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:50:35,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:50:35,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:50:35,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:50:35,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:50:35,679 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:50:35,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:50:35,679 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:50:35,680 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:50:35,680 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:50:35,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:50:35,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:50:35,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:50:35,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:50:35,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:50:35,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:50:35,681 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:50:35,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:50:35,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:50:35,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:50:35,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:50:35,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:50:35,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:50:35,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:50:35,681 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 -> 4714a0c6536056117a4ee0063fda0c81448928e693130365c60e5088462281df [2025-03-04 01:50:35,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:50:35,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:50:35,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:50:35,891 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:50:35,892 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:50:35,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-4.i [2025-03-04 01:50:36,984 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99e788deb/bd0982134e714c7a900406a8887c605e/FLAG2caf3fa20 [2025-03-04 01:50:37,238 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:50:37,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-4.i [2025-03-04 01:50:37,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99e788deb/bd0982134e714c7a900406a8887c605e/FLAG2caf3fa20 [2025-03-04 01:50:37,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99e788deb/bd0982134e714c7a900406a8887c605e [2025-03-04 01:50:37,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:50:37,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:50:37,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:50:37,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:50:37,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:50:37,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:50:37" (1/1) ... [2025-03-04 01:50:37,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73f459ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:37, skipping insertion in model container [2025-03-04 01:50:37,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:50:37" (1/1) ... [2025-03-04 01:50:37,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:50:37,666 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-sp_file-4.i[916,929] [2025-03-04 01:50:37,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:50:37,712 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:50:37,719 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-sp_file-4.i[916,929] [2025-03-04 01:50:37,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:50:37,761 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:50:37,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:37 WrapperNode [2025-03-04 01:50:37,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:50:37,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:50:37,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:50:37,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:50:37,766 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:50:37" (1/1) ... [2025-03-04 01:50:37,774 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:50:37" (1/1) ... [2025-03-04 01:50:37,802 INFO L138 Inliner]: procedures = 30, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2025-03-04 01:50:37,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:50:37,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:50:37,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:50:37,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:50:37,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:37" (1/1) ... [2025-03-04 01:50:37,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:37" (1/1) ... [2025-03-04 01:50:37,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:37" (1/1) ... [2025-03-04 01:50:37,828 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:50:37,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:37" (1/1) ... [2025-03-04 01:50:37,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:37" (1/1) ... [2025-03-04 01:50:37,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:37" (1/1) ... [2025-03-04 01:50:37,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:37" (1/1) ... [2025-03-04 01:50:37,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:37" (1/1) ... [2025-03-04 01:50:37,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:37" (1/1) ... [2025-03-04 01:50:37,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:50:37,843 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:50:37,843 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:50:37,843 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:50:37,844 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:37" (1/1) ... [2025-03-04 01:50:37,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:50:37,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:50:37,870 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:50:37,871 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:50:37,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:50:37,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:50:37,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:50:37,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:50:37,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:50:37,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:50:37,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:50:37,886 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:50:37,886 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:50:37,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:50:37,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:50:37,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:50:37,966 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:50:37,968 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:50:38,383 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L122: havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite102#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite101#1;havoc property_#t~mem100#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~mem106#1;havoc property_#t~ite119#1;havoc property_#t~mem112#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite111#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem118#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite137#1;havoc property_#t~mem133#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem136#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2025-03-04 01:50:38,419 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2025-03-04 01:50:38,420 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:50:38,427 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:50:38,429 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:50:38,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:50:38 BoogieIcfgContainer [2025-03-04 01:50:38,430 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:50:38,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:50:38,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:50:38,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:50:38,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:50:37" (1/3) ... [2025-03-04 01:50:38,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ede599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:50:38, skipping insertion in model container [2025-03-04 01:50:38,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:50:37" (2/3) ... [2025-03-04 01:50:38,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ede599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:50:38, skipping insertion in model container [2025-03-04 01:50:38,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:50:38" (3/3) ... [2025-03-04 01:50:38,438 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-4.i [2025-03-04 01:50:38,448 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:50:38,449 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-4.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:50:38,489 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:50:38,498 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;@d2d4050, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:50:38,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:50:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:50:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:50:38,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:38,511 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:38,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:38,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:38,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1523173832, now seen corresponding path program 1 times [2025-03-04 01:50:38,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:38,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343283007] [2025-03-04 01:50:38,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:38,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:38,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:50:38,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:50:38,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:38,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 01:50:38,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:38,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343283007] [2025-03-04 01:50:38,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343283007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:50:38,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206325958] [2025-03-04 01:50:38,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:38,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:50:38,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:50:38,833 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:50:38,834 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:50:38,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:50:39,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:50:39,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:39,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:39,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:50:39,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:50:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 01:50:39,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:50:39,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206325958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:39,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:50:39,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:50:39,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197554949] [2025-03-04 01:50:39,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:39,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:50:39,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:39,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:50:39,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:50:39,076 INFO L87 Difference]: Start difference. First operand has 109 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:50:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:39,098 INFO L93 Difference]: Finished difference Result 212 states and 328 transitions. [2025-03-04 01:50:39,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:50:39,099 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-04 01:50:39,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:39,103 INFO L225 Difference]: With dead ends: 212 [2025-03-04 01:50:39,103 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 01:50:39,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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:50:39,107 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:39,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:50:39,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 01:50:39,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-04 01:50:39,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:50:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2025-03-04 01:50:39,131 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 130 [2025-03-04 01:50:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:39,131 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2025-03-04 01:50:39,132 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:50:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2025-03-04 01:50:39,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:50:39,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:39,133 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:39,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:50:39,336 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:50:39,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:39,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:39,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1775485727, now seen corresponding path program 1 times [2025-03-04 01:50:39,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:39,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461512232] [2025-03-04 01:50:39,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:39,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:39,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:50:39,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:50:39,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:39,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:50:39,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:39,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461512232] [2025-03-04 01:50:39,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461512232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:39,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:39,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:50:39,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628816159] [2025-03-04 01:50:39,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:39,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:50:39,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:39,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:50:39,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:50:39,681 INFO L87 Difference]: Start difference. First operand 106 states and 154 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:50:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:39,723 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2025-03-04 01:50:39,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:50:39,724 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-04 01:50:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:39,725 INFO L225 Difference]: With dead ends: 212 [2025-03-04 01:50:39,725 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 01:50:39,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:50:39,726 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:39,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 444 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:50:39,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 01:50:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-03-04 01:50:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:50:39,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2025-03-04 01:50:39,733 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 130 [2025-03-04 01:50:39,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:39,734 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2025-03-04 01:50:39,735 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:50:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2025-03-04 01:50:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:50:39,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:39,736 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:39,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:50:39,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:39,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:39,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1774562206, now seen corresponding path program 1 times [2025-03-04 01:50:39,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:39,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180054676] [2025-03-04 01:50:39,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:39,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:39,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:50:39,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:50:39,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:39,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:50:40,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:40,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180054676] [2025-03-04 01:50:40,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180054676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:40,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:40,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:50:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516731001] [2025-03-04 01:50:40,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:40,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:50:40,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:40,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:50:40,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:50:40,835 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:50:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:41,159 INFO L93 Difference]: Finished difference Result 250 states and 360 transitions. [2025-03-04 01:50:41,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:50:41,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-04 01:50:41,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:41,161 INFO L225 Difference]: With dead ends: 250 [2025-03-04 01:50:41,161 INFO L226 Difference]: Without dead ends: 145 [2025-03-04 01:50:41,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:50:41,162 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 195 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:41,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 447 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:50:41,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-04 01:50:41,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 118. [2025-03-04 01:50:41,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:50:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2025-03-04 01:50:41,179 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 130 [2025-03-04 01:50:41,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:41,180 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2025-03-04 01:50:41,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:50:41,180 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2025-03-04 01:50:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:50:41,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:41,182 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:41,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:50:41,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:41,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:41,183 INFO L85 PathProgramCache]: Analyzing trace with hash 723453731, now seen corresponding path program 1 times [2025-03-04 01:50:41,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:41,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752752659] [2025-03-04 01:50:41,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:41,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:41,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:50:41,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:50:41,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:41,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:50:41,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:41,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752752659] [2025-03-04 01:50:41,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752752659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:50:41,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190330001] [2025-03-04 01:50:41,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:41,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:50:41,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:50:41,359 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:50:41,360 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:50:41,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:50:41,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:50:41,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:41,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:41,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:50:41,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:50:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:50:41,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:50:41,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190330001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:41,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:50:41,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:50:41,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911346892] [2025-03-04 01:50:41,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:41,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:50:41,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:41,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:50:41,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:50:41,602 INFO L87 Difference]: Start difference. First operand 118 states and 170 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:50:41,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:41,640 INFO L93 Difference]: Finished difference Result 237 states and 343 transitions. [2025-03-04 01:50:41,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:50:41,640 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-04 01:50:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:41,642 INFO L225 Difference]: With dead ends: 237 [2025-03-04 01:50:41,642 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 01:50:41,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 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:50:41,643 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:41,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:50:41,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 01:50:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-04 01:50:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 105 states have internal predecessors, (144), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:50:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2025-03-04 01:50:41,652 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 130 [2025-03-04 01:50:41,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:41,652 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2025-03-04 01:50:41,652 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:50:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2025-03-04 01:50:41,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:50:41,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:41,653 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:41,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:50:41,856 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,SelfDestructingSolverStorable3 [2025-03-04 01:50:41,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:41,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:41,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1405518979, now seen corresponding path program 1 times [2025-03-04 01:50:41,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:41,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649410364] [2025-03-04 01:50:41,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:41,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:41,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:50:41,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:50:41,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:41,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:50:42,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:42,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649410364] [2025-03-04 01:50:42,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649410364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:50:42,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243605008] [2025-03-04 01:50:42,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:42,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:50:42,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:50:42,029 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:50:42,031 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:50:42,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:50:42,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:50:42,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:42,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:42,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:50:42,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:50:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:50:42,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:50:42,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243605008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:42,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:50:42,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:50:42,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795985956] [2025-03-04 01:50:42,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:42,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:50:42,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:42,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:50:42,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:50:42,268 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:50:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:42,299 INFO L93 Difference]: Finished difference Result 247 states and 353 transitions. [2025-03-04 01:50:42,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:50:42,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-03-04 01:50:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:42,301 INFO L225 Difference]: With dead ends: 247 [2025-03-04 01:50:42,301 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 01:50:42,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 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:50:42,303 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 590 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:50:42,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 590 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:50:42,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 01:50:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2025-03-04 01:50:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 107 states have internal predecessors, (146), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:50:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2025-03-04 01:50:42,316 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 132 [2025-03-04 01:50:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:42,316 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2025-03-04 01:50:42,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:50:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2025-03-04 01:50:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:50:42,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:42,317 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:42,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:50:42,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:50:42,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:42,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:42,518 INFO L85 PathProgramCache]: Analyzing trace with hash 877241248, now seen corresponding path program 1 times [2025-03-04 01:50:42,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:42,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878832647] [2025-03-04 01:50:42,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:42,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:42,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:50:42,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:50:42,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:42,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:44,720 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:50:44,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:44,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878832647] [2025-03-04 01:50:44,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878832647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:44,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:44,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:50:44,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406226093] [2025-03-04 01:50:44,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:44,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:50:44,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:44,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:50:44,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:50:44,722 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-04 01:50:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:45,743 INFO L93 Difference]: Finished difference Result 298 states and 421 transitions. [2025-03-04 01:50:45,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:50:45,744 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 133 [2025-03-04 01:50:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:45,745 INFO L225 Difference]: With dead ends: 298 [2025-03-04 01:50:45,745 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 01:50:45,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:50:45,746 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 434 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:45,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 512 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:50:45,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 01:50:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 134. [2025-03-04 01:50:45,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 117 states have (on average 1.376068376068376) internal successors, (161), 117 states have internal predecessors, (161), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:50:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 191 transitions. [2025-03-04 01:50:45,762 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 191 transitions. Word has length 133 [2025-03-04 01:50:45,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:45,763 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 191 transitions. [2025-03-04 01:50:45,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-04 01:50:45,763 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 191 transitions. [2025-03-04 01:50:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:50:45,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:45,765 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:45,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:50:45,765 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:45,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:45,765 INFO L85 PathProgramCache]: Analyzing trace with hash 366707071, now seen corresponding path program 1 times [2025-03-04 01:50:45,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:45,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736769587] [2025-03-04 01:50:45,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:45,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:45,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:50:45,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:50:45,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:45,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:50:46,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:46,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736769587] [2025-03-04 01:50:46,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736769587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:46,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:46,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:50:46,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308199638] [2025-03-04 01:50:46,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:46,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:50:46,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:46,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:50:46,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:50:46,728 INFO L87 Difference]: Start difference. First operand 134 states and 191 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:50:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:47,317 INFO L93 Difference]: Finished difference Result 269 states and 384 transitions. [2025-03-04 01:50:47,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:50:47,318 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2025-03-04 01:50:47,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:47,319 INFO L225 Difference]: With dead ends: 269 [2025-03-04 01:50:47,319 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 01:50:47,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:50:47,320 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 249 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:47,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 402 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:50:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 01:50:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2025-03-04 01:50:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:50:47,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 176 transitions. [2025-03-04 01:50:47,336 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 176 transitions. Word has length 133 [2025-03-04 01:50:47,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:47,336 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 176 transitions. [2025-03-04 01:50:47,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:50:47,336 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 176 transitions. [2025-03-04 01:50:47,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:50:47,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:47,339 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:47,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:50:47,339 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:47,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:47,340 INFO L85 PathProgramCache]: Analyzing trace with hash -183403585, now seen corresponding path program 1 times [2025-03-04 01:50:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:47,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356415213] [2025-03-04 01:50:47,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:47,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:47,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:50:47,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:50:47,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:47,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:50:49,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:49,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356415213] [2025-03-04 01:50:49,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356415213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:49,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:49,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:50:49,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743788700] [2025-03-04 01:50:49,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:49,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:50:49,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:49,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:50:49,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:50:49,239 INFO L87 Difference]: Start difference. First operand 123 states and 176 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-04 01:50:50,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:50,195 INFO L93 Difference]: Finished difference Result 286 states and 405 transitions. [2025-03-04 01:50:50,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:50:50,195 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2025-03-04 01:50:50,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:50,197 INFO L225 Difference]: With dead ends: 286 [2025-03-04 01:50:50,197 INFO L226 Difference]: Without dead ends: 166 [2025-03-04 01:50:50,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:50:50,197 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 499 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:50,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 459 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:50:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-04 01:50:50,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 127. [2025-03-04 01:50:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 110 states have (on average 1.3818181818181818) internal successors, (152), 110 states have internal predecessors, (152), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:50:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 182 transitions. [2025-03-04 01:50:50,206 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 182 transitions. Word has length 134 [2025-03-04 01:50:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:50,207 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 182 transitions. [2025-03-04 01:50:50,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-04 01:50:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 182 transitions. [2025-03-04 01:50:50,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:50:50,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:50,209 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:50,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:50:50,209 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:50,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:50,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1324148224, now seen corresponding path program 1 times [2025-03-04 01:50:50,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:50,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406649002] [2025-03-04 01:50:50,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:50,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:50,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:50:50,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:50:50,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:50,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:50:50,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:50,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406649002] [2025-03-04 01:50:50,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406649002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:50:50,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:50:50,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:50:50,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152076444] [2025-03-04 01:50:50,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:50:50,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:50:50,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:50:50,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:50:50,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:50:50,748 INFO L87 Difference]: Start difference. First operand 127 states and 182 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:50:51,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:50:51,035 INFO L93 Difference]: Finished difference Result 284 states and 404 transitions. [2025-03-04 01:50:51,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:50:51,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-03-04 01:50:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:50:51,037 INFO L225 Difference]: With dead ends: 284 [2025-03-04 01:50:51,037 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 01:50:51,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:50:51,038 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 38 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:50:51,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 429 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:50:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 01:50:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2025-03-04 01:50:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.375) internal successors, (154), 112 states have internal predecessors, (154), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:50:51,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 184 transitions. [2025-03-04 01:50:51,050 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 184 transitions. Word has length 134 [2025-03-04 01:50:51,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:50:51,051 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 184 transitions. [2025-03-04 01:50:51,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:50:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 184 transitions. [2025-03-04 01:50:51,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:50:51,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:50:51,052 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:51,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:50:51,052 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:50:51,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:50:51,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1466046906, now seen corresponding path program 1 times [2025-03-04 01:50:51,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:50:51,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482762524] [2025-03-04 01:50:51,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:51,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:50:51,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:50:51,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:50:51,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:51,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:50:54,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:50:54,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482762524] [2025-03-04 01:50:54,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482762524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:50:54,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949004926] [2025-03-04 01:50:54,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:54,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:50:54,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:50:54,463 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:50:54,464 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:50:54,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:50:54,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:50:54,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:54,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:54,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-04 01:50:54,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:50:54,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:50:55,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:50:55,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:50:55,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:50:55,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:50:56,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:50:56,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:50:56,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:50:57,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:50:57,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-03-04 01:50:57,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:50:57,441 INFO L349 Elim1Store]: treesize reduction 64, result has 40.2 percent of original size [2025-03-04 01:50:57,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 79 [2025-03-04 01:50:57,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:50:57,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:50:57,721 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2025-03-04 01:50:57,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2025-03-04 01:50:58,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:50:58,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 101 [2025-03-04 01:50:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-03-04 01:50:58,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:51:12,258 WARN L851 $PredicateComparison]: unable to prove that (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset Int) (~WrapperStruct00_var_1_11_Pointer~0.offset Int) (~WrapperStruct00_var_1_10_Pointer~0.base Int) (v_ArrVal_1255 (Array Int Int)) (~WrapperStruct00_var_1_17_Pointer~0.offset Int) (~WrapperStruct00_var_1_17_Pointer~0.base Int) (|ULTIMATE.start_step_#t~ite9#1| Int)) (not (let ((.cse0 (+ c_~last_1_WrapperStruct00_var_1_12~0 (* (- 4294967296) (div c_~last_1_WrapperStruct00_var_1_12~0 4294967296)))) (.cse1 (let ((.cse2 (select (select (let ((.cse3 (let ((.cse5 (store |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset |ULTIMATE.start_step_#t~ite9#1|)))) (store .cse5 c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select .cse5 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset (+ (select (select .cse5 ~WrapperStruct00_var_1_17_Pointer~0.base) ~WrapperStruct00_var_1_17_Pointer~0.offset) (* (- 1) (mod (select (select .cse5 ~WrapperStruct00_var_1_10_Pointer~0.base) ~WrapperStruct00_var_1_10_Pointer~0.offset) 256)))))))) (store (store .cse3 c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_1255) c_~WrapperStruct00_var_1_7_Pointer~0.base (let ((.cse4 (select (select .cse3 c_~WrapperStruct00_var_1_11_Pointer~0.base) ~WrapperStruct00_var_1_11_Pointer~0.offset))) (store (select (store .cse3 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset .cse4)) c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (mod .cse4 256))))) c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset))) (+ (* (div .cse2 4294967296) (- 4294967296)) .cse2)))) (= (div .cse0 .cse1) (+ (mod (+ c_~last_1_WrapperStruct00_var_1_18~0 4294967232 (* (div c_~last_1_WrapperStruct00_var_1_18~0 256) 4294967040)) 4294967296) (* (div .cse0 .cse1 4294967296) 4294967296)))))) is different from false [2025-03-04 01:51:18,587 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 4294967296)) (.cse10 (+ c_~last_1_WrapperStruct00_var_1_12~0 (* (- 4294967296) (div c_~last_1_WrapperStruct00_var_1_12~0 4294967296)))) (.cse16 (select |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base))) (and (forall ((v_y_13 Int) (v_y_6 Int) (~WrapperStruct00_var_1_10_Pointer~0.offset Int) (~WrapperStruct00_var_1_11_Pointer~0.offset Int) (~WrapperStruct00_var_1_10_Pointer~0.base Int) (v_ArrVal_1255 (Array Int Int)) (~WrapperStruct00_var_1_17_Pointer~0.offset Int) (~WrapperStruct00_var_1_17_Pointer~0.base Int) (v_y_8 Int) (|ULTIMATE.start_step_#t~ite9#1| Int)) (let ((.cse11 (let ((.cse12 (select (select (let ((.cse13 (let ((.cse15 (store |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse16 c_~WrapperStruct00_var_1_8_Pointer~0.offset |ULTIMATE.start_step_#t~ite9#1|)))) (store .cse15 c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select .cse15 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset (+ (select (select .cse15 ~WrapperStruct00_var_1_17_Pointer~0.base) ~WrapperStruct00_var_1_17_Pointer~0.offset) (* (- 1) (mod (select (select .cse15 ~WrapperStruct00_var_1_10_Pointer~0.base) ~WrapperStruct00_var_1_10_Pointer~0.offset) 256)))))))) (store (store .cse13 c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_1255) c_~WrapperStruct00_var_1_7_Pointer~0.base (let ((.cse14 (select (select .cse13 c_~WrapperStruct00_var_1_11_Pointer~0.base) ~WrapperStruct00_var_1_11_Pointer~0.offset))) (store (select (store .cse13 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse13 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset .cse14)) c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (mod .cse14 256))))) c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset))) (+ (* (div .cse12 4294967296) (- 4294967296)) .cse12)))) (let ((.cse2 (* v_y_8 4294967296)) (.cse1 (div .cse10 .cse11)) (.cse3 (* v_y_13 4294967296)) (.cse6 (* (div .cse10 .cse11 4294967296) 4294967296)) (.cse7 (* 256 v_y_6))) (let ((.cse0 (+ 4294967231 .cse6 .cse7)) (.cse5 (+ .cse1 .cse3)) (.cse4 (+ .cse6 .cse7)) (.cse8 (+ .cse2 .cse1 .cse3))) (or (< .cse0 .cse1) (< (+ .cse2 64 .cse1 .cse3) .cse4) (< .cse0 .cse5) (< (+ .cse6 .cse7 191) .cse8) (= (+ .cse6 .cse9 .cse7) .cse5) (< (+ 64 .cse1 .cse3) .cse4) (< (+ .cse6 191) .cse8)))))) (forall ((v_y_13 Int) (v_y_6 Int) (~WrapperStruct00_var_1_10_Pointer~0.offset Int) (~WrapperStruct00_var_1_11_Pointer~0.offset Int) (~WrapperStruct00_var_1_10_Pointer~0.base Int) (v_ArrVal_1255 (Array Int Int)) (~WrapperStruct00_var_1_17_Pointer~0.offset Int) (~WrapperStruct00_var_1_17_Pointer~0.base Int) (v_y_8 Int) (|ULTIMATE.start_step_#t~ite9#1| Int)) (let ((.cse24 (let ((.cse25 (select (select (let ((.cse26 (let ((.cse28 (store |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse16 c_~WrapperStruct00_var_1_8_Pointer~0.offset |ULTIMATE.start_step_#t~ite9#1|)))) (store .cse28 c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select .cse28 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset (+ (select (select .cse28 ~WrapperStruct00_var_1_17_Pointer~0.base) ~WrapperStruct00_var_1_17_Pointer~0.offset) (* (- 1) (mod (select (select .cse28 ~WrapperStruct00_var_1_10_Pointer~0.base) ~WrapperStruct00_var_1_10_Pointer~0.offset) 256)))))))) (store (store .cse26 c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_1255) c_~WrapperStruct00_var_1_7_Pointer~0.base (let ((.cse27 (select (select .cse26 c_~WrapperStruct00_var_1_11_Pointer~0.base) ~WrapperStruct00_var_1_11_Pointer~0.offset))) (store (select (store .cse26 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse26 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset .cse27)) c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (mod .cse27 256))))) c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset))) (+ (* (div .cse25 4294967296) (- 4294967296)) .cse25)))) (let ((.cse19 (div .cse10 .cse24)) (.cse23 (* v_y_13 4294967296)) (.cse20 (* (div .cse10 .cse24 4294967296) 4294967296)) (.cse21 (* 256 v_y_6))) (let ((.cse18 (+ .cse20 4294967232 .cse21)) (.cse22 (+ (* v_y_8 4294967296) .cse19 .cse23)) (.cse17 (+ .cse19 .cse23))) (or (< .cse17 .cse18) (< .cse19 .cse18) (< (+ .cse20 4294967487 .cse21) .cse22) (< .cse22 (+ .cse20 4294967232)) (= (+ .cse20 .cse9 .cse21) .cse17) (< (+ .cse20 8589934527 .cse21) .cse17)))))) (forall ((v_y_14 Int) (v_y_6 Int) (~WrapperStruct00_var_1_10_Pointer~0.offset Int) (~WrapperStruct00_var_1_11_Pointer~0.offset Int) (~WrapperStruct00_var_1_10_Pointer~0.base Int) (v_ArrVal_1255 (Array Int Int)) (~WrapperStruct00_var_1_17_Pointer~0.offset Int) (~WrapperStruct00_var_1_17_Pointer~0.base Int) (v_y_8 Int) (|ULTIMATE.start_step_#t~ite9#1| Int)) (let ((.cse40 (let ((.cse41 (select (select (let ((.cse42 (let ((.cse44 (store |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse16 c_~WrapperStruct00_var_1_8_Pointer~0.offset |ULTIMATE.start_step_#t~ite9#1|)))) (store .cse44 c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select .cse44 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset (+ (select (select .cse44 ~WrapperStruct00_var_1_17_Pointer~0.base) ~WrapperStruct00_var_1_17_Pointer~0.offset) (* (- 1) (mod (select (select .cse44 ~WrapperStruct00_var_1_10_Pointer~0.base) ~WrapperStruct00_var_1_10_Pointer~0.offset) 256)))))))) (store (store .cse42 c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_1255) c_~WrapperStruct00_var_1_7_Pointer~0.base (let ((.cse43 (select (select .cse42 c_~WrapperStruct00_var_1_11_Pointer~0.base) ~WrapperStruct00_var_1_11_Pointer~0.offset))) (store (select (store .cse42 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse42 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset .cse43)) c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (mod .cse43 256))))) c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset))) (+ (* (div .cse41 4294967296) (- 4294967296)) .cse41)))) (let ((.cse33 (* (div .cse10 .cse40 4294967296) 4294967296)) (.cse39 (* (mod (+ 67108863 (* v_y_6 4)) 67108864) 64)) (.cse38 (* v_y_8 4294967296)) (.cse36 (* v_y_14 4294967296)) (.cse37 (div .cse10 .cse40)) (.cse34 (* 256 v_y_6))) (let ((.cse32 (+ .cse38 .cse36 .cse37 .cse34)) (.cse30 (+ .cse33 .cse39)) (.cse31 (+ .cse33 255 .cse39)) (.cse29 (+ .cse38 .cse36 .cse37)) (.cse35 (+ .cse36 .cse37))) (or (< .cse29 .cse30) (< .cse31 .cse32) (< .cse32 .cse30) (< .cse31 .cse29) (< (+ .cse33 4294967295 .cse34) .cse35) (= (+ .cse33 .cse9 .cse34) .cse35) (< .cse35 (+ .cse33 4294967232 .cse34))))))) (forall ((v_y_12 Int) (v_y_6 Int) (~WrapperStruct00_var_1_10_Pointer~0.offset Int) (~WrapperStruct00_var_1_11_Pointer~0.offset Int) (~WrapperStruct00_var_1_10_Pointer~0.base Int) (v_ArrVal_1255 (Array Int Int)) (~WrapperStruct00_var_1_17_Pointer~0.offset Int) (~WrapperStruct00_var_1_17_Pointer~0.base Int) (v_y_8 Int) (|ULTIMATE.start_step_#t~ite9#1| Int)) (let ((.cse52 (let ((.cse53 (select (select (let ((.cse54 (let ((.cse56 (store |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse16 c_~WrapperStruct00_var_1_8_Pointer~0.offset |ULTIMATE.start_step_#t~ite9#1|)))) (store .cse56 c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select .cse56 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset (+ (select (select .cse56 ~WrapperStruct00_var_1_17_Pointer~0.base) ~WrapperStruct00_var_1_17_Pointer~0.offset) (* (- 1) (mod (select (select .cse56 ~WrapperStruct00_var_1_10_Pointer~0.base) ~WrapperStruct00_var_1_10_Pointer~0.offset) 256)))))))) (store (store .cse54 c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_1255) c_~WrapperStruct00_var_1_7_Pointer~0.base (let ((.cse55 (select (select .cse54 c_~WrapperStruct00_var_1_11_Pointer~0.base) ~WrapperStruct00_var_1_11_Pointer~0.offset))) (store (select (store .cse54 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse54 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset .cse55)) c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (mod .cse55 256))))) c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset))) (+ (* (div .cse53 4294967296) (- 4294967296)) .cse53)))) (let ((.cse45 (* (div .cse10 .cse52 4294967296) 4294967296)) (.cse50 (div .cse10 .cse52)) (.cse51 (* v_y_12 4294967296))) (let ((.cse47 (+ .cse50 .cse51)) (.cse46 (* 256 v_y_6)) (.cse49 (* v_y_8 4294967296)) (.cse48 (+ .cse45 (* (mod (+ 67108863 (* v_y_6 4)) 67108864) 64)))) (or (< (+ 4294967231 .cse45 .cse46) .cse47) (< .cse47 (+ .cse45 .cse46)) (< .cse48 (+ .cse49 .cse50 4294967041 .cse51)) (< .cse48 (+ .cse49 .cse50 4294967041 .cse51 .cse46)) (= (+ .cse45 .cse9 .cse46) .cse47) (< (+ .cse49 .cse50 .cse51 .cse46 4294967296) .cse48) (< (+ .cse49 .cse50 .cse51 4294967296) .cse48)))))))) is different from false [2025-03-04 01:51:29,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (select (select |c_#memory_int| c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) 4294967296)) (.cse18 (select |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base))) (and (forall ((v_y_14 Int) (v_y_6 Int) (~WrapperStruct00_var_1_10_Pointer~0.offset Int) (~WrapperStruct00_var_1_11_Pointer~0.offset Int) (~WrapperStruct00_var_1_10_Pointer~0.base Int) (v_ArrVal_1255 (Array Int Int)) (~WrapperStruct00_var_1_17_Pointer~0.offset Int) (~WrapperStruct00_var_1_17_Pointer~0.base Int) (v_z_40 Int) (v_y_40 Int) (v_y_8 Int) (|ULTIMATE.start_step_#t~ite9#1| Int)) (let ((.cse7 (+ v_z_40 (* v_y_40 4294967296))) (.cse13 (let ((.cse14 (select (select (let ((.cse15 (let ((.cse17 (store |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse18 c_~WrapperStruct00_var_1_8_Pointer~0.offset |ULTIMATE.start_step_#t~ite9#1|)))) (store .cse17 c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select .cse17 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset (+ (select (select .cse17 ~WrapperStruct00_var_1_17_Pointer~0.base) ~WrapperStruct00_var_1_17_Pointer~0.offset) (* (- 1) (mod (select (select .cse17 ~WrapperStruct00_var_1_10_Pointer~0.base) ~WrapperStruct00_var_1_10_Pointer~0.offset) 256)))))))) (store (store .cse15 c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_1255) c_~WrapperStruct00_var_1_7_Pointer~0.base (let ((.cse16 (select (select .cse15 c_~WrapperStruct00_var_1_11_Pointer~0.base) ~WrapperStruct00_var_1_11_Pointer~0.offset))) (store (select (store .cse15 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse15 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset .cse16)) c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (mod .cse16 256))))) c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset))) (+ (* (div .cse14 4294967296) (- 4294967296)) .cse14)))) (let ((.cse9 (* v_y_8 4294967296)) (.cse3 (* 256 v_y_6)) (.cse10 (* v_y_14 4294967296)) (.cse11 (div .cse7 .cse13)) (.cse12 (* (mod (+ 67108863 (* v_y_6 4)) 67108864) 64)) (.cse4 (* (div .cse7 .cse13 4294967296) 4294967296))) (let ((.cse1 (+ .cse12 .cse4)) (.cse5 (+ .cse10 .cse11)) (.cse6 (+ .cse9 .cse10 .cse11 .cse3)) (.cse8 (+ 255 .cse12 .cse4)) (.cse0 (+ .cse9 .cse10 .cse11))) (or (< .cse0 .cse1) (= (+ (mod (div v_z_40 .cse2) 4294967296) .cse3 .cse4) .cse5) (< (+ 4294967295 .cse3 .cse4) .cse5) (< .cse6 .cse1) (< .cse7 0) (< 4294967295 .cse7) (< .cse5 (+ 4294967232 .cse3 .cse4)) (< v_z_40 0) (< .cse8 .cse6) (< .cse8 .cse0) (< 4294967295 v_z_40)))))) (forall ((v_y_12 Int) (v_z_49 Int) (v_y_6 Int) (~WrapperStruct00_var_1_10_Pointer~0.offset Int) (~WrapperStruct00_var_1_11_Pointer~0.offset Int) (v_y_49 Int) (~WrapperStruct00_var_1_10_Pointer~0.base Int) (v_ArrVal_1255 (Array Int Int)) (~WrapperStruct00_var_1_17_Pointer~0.offset Int) (~WrapperStruct00_var_1_17_Pointer~0.base Int) (v_y_8 Int) (|ULTIMATE.start_step_#t~ite9#1| Int)) (let ((.cse26 (+ v_z_49 (* v_y_49 4294967296))) (.cse27 (let ((.cse28 (select (select (let ((.cse29 (let ((.cse31 (store |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse18 c_~WrapperStruct00_var_1_8_Pointer~0.offset |ULTIMATE.start_step_#t~ite9#1|)))) (store .cse31 c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select .cse31 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset (+ (select (select .cse31 ~WrapperStruct00_var_1_17_Pointer~0.base) ~WrapperStruct00_var_1_17_Pointer~0.offset) (* (- 1) (mod (select (select .cse31 ~WrapperStruct00_var_1_10_Pointer~0.base) ~WrapperStruct00_var_1_10_Pointer~0.offset) 256)))))))) (store (store .cse29 c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_1255) c_~WrapperStruct00_var_1_7_Pointer~0.base (let ((.cse30 (select (select .cse29 c_~WrapperStruct00_var_1_11_Pointer~0.base) ~WrapperStruct00_var_1_11_Pointer~0.offset))) (store (select (store .cse29 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse29 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset .cse30)) c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (mod .cse30 256))))) c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset))) (+ (* (div .cse28 4294967296) (- 4294967296)) .cse28)))) (let ((.cse23 (* v_y_12 4294967296)) (.cse24 (div .cse26 .cse27)) (.cse20 (* (div .cse26 .cse27 4294967296) 4294967296))) (let ((.cse22 (* v_y_8 4294967296)) (.cse25 (+ .cse20 (* (mod (+ 67108863 (* v_y_6 4)) 67108864) 64))) (.cse19 (+ .cse23 .cse24)) (.cse21 (* 256 v_y_6))) (or (< .cse19 (+ .cse20 .cse21)) (< (+ 4294967231 .cse20 .cse21) .cse19) (< (+ .cse22 .cse23 .cse21 4294967296 .cse24) .cse25) (< .cse25 (+ .cse22 4294967041 .cse23 .cse24)) (< .cse25 (+ .cse22 4294967041 .cse23 .cse21 .cse24)) (< 4294967295 v_z_49) (< (+ .cse22 .cse23 4294967296 .cse24) .cse25) (= .cse19 (+ (mod (div v_z_49 .cse2) 4294967296) .cse20 .cse21)) (< 4294967295 .cse26) (< v_z_49 0) (< .cse26 0)))))) (forall ((v_y_23 Int) (v_y_13 Int) (v_y_6 Int) (~WrapperStruct00_var_1_10_Pointer~0.offset Int) (~WrapperStruct00_var_1_11_Pointer~0.offset Int) (~WrapperStruct00_var_1_10_Pointer~0.base Int) (v_ArrVal_1255 (Array Int Int)) (~WrapperStruct00_var_1_17_Pointer~0.offset Int) (~WrapperStruct00_var_1_17_Pointer~0.base Int) (v_y_8 Int) (|ULTIMATE.start_step_#t~ite9#1| Int) (v_z_23 Int)) (let ((.cse39 (+ (* v_y_23 4294967296) v_z_23)) (.cse42 (let ((.cse43 (select (select (let ((.cse44 (let ((.cse46 (store |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse18 c_~WrapperStruct00_var_1_8_Pointer~0.offset |ULTIMATE.start_step_#t~ite9#1|)))) (store .cse46 c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select .cse46 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset (+ (select (select .cse46 ~WrapperStruct00_var_1_17_Pointer~0.base) ~WrapperStruct00_var_1_17_Pointer~0.offset) (* (- 1) (mod (select (select .cse46 ~WrapperStruct00_var_1_10_Pointer~0.base) ~WrapperStruct00_var_1_10_Pointer~0.offset) 256)))))))) (store (store .cse44 c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_1255) c_~WrapperStruct00_var_1_7_Pointer~0.base (let ((.cse45 (select (select .cse44 c_~WrapperStruct00_var_1_11_Pointer~0.base) ~WrapperStruct00_var_1_11_Pointer~0.offset))) (store (select (store .cse44 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse44 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset .cse45)) c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (mod .cse45 256))))) c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset))) (+ (* (div .cse43 4294967296) (- 4294967296)) .cse43)))) (let ((.cse38 (* v_y_8 4294967296)) (.cse33 (div .cse39 .cse42)) (.cse36 (* v_y_13 4294967296)) (.cse34 (* (div .cse39 .cse42 4294967296) 4294967296)) (.cse41 (* 256 v_y_6))) (let ((.cse37 (+ .cse34 .cse41)) (.cse35 (+ .cse38 .cse33 .cse36)) (.cse32 (+ 4294967231 .cse34 .cse41)) (.cse40 (+ .cse33 .cse36))) (or (< .cse32 .cse33) (< (+ .cse34 191) .cse35) (< v_z_23 0) (< (+ 64 .cse33 .cse36) .cse37) (< (+ .cse38 64 .cse33 .cse36) .cse37) (< .cse39 0) (= .cse40 (+ .cse34 .cse41 (mod (div v_z_23 .cse2) 4294967296))) (< (+ .cse34 .cse41 191) .cse35) (< 4294967295 .cse39) (< .cse32 .cse40) (< 4294967295 v_z_23)))))) (forall ((v_y_13 Int) (v_y_6 Int) (~WrapperStruct00_var_1_10_Pointer~0.offset Int) (~WrapperStruct00_var_1_11_Pointer~0.offset Int) (~WrapperStruct00_var_1_10_Pointer~0.base Int) (v_ArrVal_1255 (Array Int Int)) (~WrapperStruct00_var_1_17_Pointer~0.offset Int) (~WrapperStruct00_var_1_17_Pointer~0.base Int) (v_y_8 Int) (|ULTIMATE.start_step_#t~ite9#1| Int) (v_y_31 Int) (v_z_31 Int)) (let ((.cse53 (+ (* v_y_31 4294967296) v_z_31)) (.cse55 (let ((.cse56 (select (select (let ((.cse57 (let ((.cse59 (store |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse18 c_~WrapperStruct00_var_1_8_Pointer~0.offset |ULTIMATE.start_step_#t~ite9#1|)))) (store .cse59 c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select .cse59 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset (+ (select (select .cse59 ~WrapperStruct00_var_1_17_Pointer~0.base) ~WrapperStruct00_var_1_17_Pointer~0.offset) (* (- 1) (mod (select (select .cse59 ~WrapperStruct00_var_1_10_Pointer~0.base) ~WrapperStruct00_var_1_10_Pointer~0.offset) 256)))))))) (store (store .cse57 c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_1255) c_~WrapperStruct00_var_1_7_Pointer~0.base (let ((.cse58 (select (select .cse57 c_~WrapperStruct00_var_1_11_Pointer~0.base) ~WrapperStruct00_var_1_11_Pointer~0.offset))) (store (select (store .cse57 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse57 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset .cse58)) c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (mod .cse58 256))))) c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset))) (+ (* (div .cse56 4294967296) (- 4294967296)) .cse56)))) (let ((.cse47 (* 256 v_y_6)) (.cse48 (* 4294967296 (div .cse53 .cse55 4294967296))) (.cse52 (div .cse53 .cse55)) (.cse54 (* v_y_13 4294967296))) (let ((.cse50 (+ .cse52 .cse54)) (.cse49 (+ .cse52 (* v_y_8 4294967296) .cse54)) (.cse51 (+ 4294967232 .cse47 .cse48))) (or (< (+ 4294967487 .cse47 .cse48) .cse49) (< .cse50 .cse51) (< (+ 8589934527 .cse47 .cse48) .cse50) (= .cse50 (+ (mod (div v_z_31 .cse2) 4294967296) .cse47 .cse48)) (< v_z_31 0) (< 4294967295 v_z_31) (< .cse49 (+ 4294967232 .cse48)) (< .cse52 .cse51) (< .cse53 0) (< 4294967295 .cse53)))))))) is different from false [2025-03-04 01:51:49,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949004926] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:51:49,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:51:49,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2025-03-04 01:51:49,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597157980] [2025-03-04 01:51:49,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:51:49,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 01:51:49,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:51:49,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 01:51:49,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=517, Unknown=7, NotChecked=144, Total=756 [2025-03-04 01:51:49,618 INFO L87 Difference]: Start difference. First operand 129 states and 184 transitions. Second operand has 22 states, 21 states have (on average 5.619047619047619) internal successors, (118), 22 states have internal predecessors, (118), 6 states have call successors, (30), 3 states have call predecessors, (30), 4 states have return successors, (30), 5 states have call predecessors, (30), 6 states have call successors, (30) [2025-03-04 01:51:59,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 01:52:04,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0]