./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.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 e1284d110aec8c9fc5da783d4e31facf9c686765dccc1866ab0c2c6ea65f610a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:59:57,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:59:57,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:59:57,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:59:57,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:59:57,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:59:57,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:59:57,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:59:57,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:59:57,589 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:59:57,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:59:57,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:59:57,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:59:57,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:59:57,590 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:59:57,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:59:57,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:59:57,591 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:59:57,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:59:57,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:59:57,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:59:57,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:59:57,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:59:57,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:59:57,592 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:59:57,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:59:57,592 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:59:57,592 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:59:57,592 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:59:57,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:59:57,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:59:57,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:59:57,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:59:57,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:59:57,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:59:57,592 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:59:57,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:59:57,592 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:59:57,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:59:57,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:59:57,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:59:57,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:59:57,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:59:57,593 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 -> e1284d110aec8c9fc5da783d4e31facf9c686765dccc1866ab0c2c6ea65f610a [2025-03-17 05:59:57,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:59:57,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:59:57,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:59:57,829 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:59:57,829 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:59:57,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i [2025-03-17 05:59:59,103 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb357cd1/9c231de1c4b74fe598e6b8b618673bbc/FLAG000eb2529 [2025-03-17 05:59:59,391 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:59:59,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i [2025-03-17 05:59:59,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb357cd1/9c231de1c4b74fe598e6b8b618673bbc/FLAG000eb2529 [2025-03-17 05:59:59,676 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb357cd1/9c231de1c4b74fe598e6b8b618673bbc [2025-03-17 05:59:59,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:59:59,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:59:59,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:59:59,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:59:59,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:59:59,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:59:59" (1/1) ... [2025-03-17 05:59:59,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@570830d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:59, skipping insertion in model container [2025-03-17 05:59:59,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:59:59" (1/1) ... [2025-03-17 05:59:59,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:59:59,849 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-s_file-64.i[916,929] [2025-03-17 05:59:59,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:59:59,943 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:59:59,955 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-s_file-64.i[916,929] [2025-03-17 05:59:59,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:00:00,011 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:00:00,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:00 WrapperNode [2025-03-17 06:00:00,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:00:00,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:00:00,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:00:00,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:00:00,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:00" (1/1) ... [2025-03-17 06:00:00,031 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:00" (1/1) ... [2025-03-17 06:00:00,072 INFO L138 Inliner]: procedures = 30, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 514 [2025-03-17 06:00:00,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:00:00,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:00:00,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:00:00,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:00:00,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:00" (1/1) ... [2025-03-17 06:00:00,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:00" (1/1) ... [2025-03-17 06:00:00,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:00" (1/1) ... [2025-03-17 06:00:00,103 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:00:00,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:00" (1/1) ... [2025-03-17 06:00:00,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:00" (1/1) ... [2025-03-17 06:00:00,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:00" (1/1) ... [2025-03-17 06:00:00,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:00" (1/1) ... [2025-03-17 06:00:00,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:00" (1/1) ... [2025-03-17 06:00:00,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:00" (1/1) ... [2025-03-17 06:00:00,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:00:00,135 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:00:00,135 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:00:00,135 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:00:00,136 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:00" (1/1) ... [2025-03-17 06:00:00,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:00:00,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:00,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:00:00,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:00:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:00:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:00:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:00:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:00:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:00:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:00:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:00:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:00:00,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:00:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:00:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:00:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:00:00,315 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:00:00,317 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:00:00,812 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L128: havoc property_#t~mem92#1;havoc property_#t~ite106#1;havoc property_#t~mem96#1;havoc property_#t~mem93#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~ite105#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite113#1;havoc property_#t~mem112#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~short111#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~ite125#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short120#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short126#1;havoc property_#t~mem129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~bitwise130#1;havoc property_#t~mem131#1;havoc property_#t~ite140#1;havoc property_#t~mem132#1;havoc property_#t~ite137#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~short141#1; [2025-03-17 06:00:00,860 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2025-03-17 06:00:00,860 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:00:00,875 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:00:00,875 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:00:00,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:00:00 BoogieIcfgContainer [2025-03-17 06:00:00,875 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:00:00,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:00:00,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:00:00,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:00:00,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:59:59" (1/3) ... [2025-03-17 06:00:00,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef373b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:00:00, skipping insertion in model container [2025-03-17 06:00:00,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:00" (2/3) ... [2025-03-17 06:00:00,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef373b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:00:00, skipping insertion in model container [2025-03-17 06:00:00,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:00:00" (3/3) ... [2025-03-17 06:00:00,884 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-64.i [2025-03-17 06:00:00,896 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:00:00,897 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-64.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:00:00,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:00:00,950 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;@294e0027, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:00:00,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:00:00,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 100 states have (on average 1.45) internal successors, (145), 101 states have internal predecessors, (145), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:00:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 06:00:00,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:00,964 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:00,964 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:00,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:00,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1171042304, now seen corresponding path program 1 times [2025-03-17 06:00:00,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:00,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973993887] [2025-03-17 06:00:00,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:00,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:01,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 06:00:01,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 06:00:01,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:01,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 06:00:01,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:01,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973993887] [2025-03-17 06:00:01,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973993887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:00:01,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639091704] [2025-03-17 06:00:01,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:01,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:01,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:01,358 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:00:01,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:00:01,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 06:00:01,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 06:00:01,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:01,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:01,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:00:01,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 06:00:01,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:01,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639091704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:01,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:00:01,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:00:01,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314380442] [2025-03-17 06:00:01,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:01,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:00:01,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:01,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:00:01,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:00:01,640 INFO L87 Difference]: Start difference. First operand has 123 states, 100 states have (on average 1.45) internal successors, (145), 101 states have internal predecessors, (145), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:00:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:01,669 INFO L93 Difference]: Finished difference Result 243 states and 388 transitions. [2025-03-17 06:00:01,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:00:01,672 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2025-03-17 06:00:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:01,677 INFO L225 Difference]: With dead ends: 243 [2025-03-17 06:00:01,677 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 06:00:01,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:00:01,682 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:01,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 06:00:01,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-17 06:00:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 99 states have internal predecessors, (141), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:00:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 181 transitions. [2025-03-17 06:00:01,717 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 181 transitions. Word has length 155 [2025-03-17 06:00:01,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:01,717 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 181 transitions. [2025-03-17 06:00:01,717 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:00:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 181 transitions. [2025-03-17 06:00:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 06:00:01,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:01,720 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:01,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 06:00:01,920 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-17 06:00:01,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:01,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:01,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1491007696, now seen corresponding path program 1 times [2025-03-17 06:00:01,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:01,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296518010] [2025-03-17 06:00:01,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:01,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:01,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 06:00:02,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 06:00:02,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:02,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 06:00:02,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:02,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296518010] [2025-03-17 06:00:02,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296518010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:00:02,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688273842] [2025-03-17 06:00:02,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:02,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:02,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:02,425 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:00:02,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:00:02,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 06:00:02,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 06:00:02,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:02,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:02,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:00:02,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:00:02,673 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:02,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688273842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:02,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:00:02,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 06:00:02,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542742605] [2025-03-17 06:00:02,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:02,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:00:02,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:02,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:00:02,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:00:02,676 INFO L87 Difference]: Start difference. First operand 121 states and 181 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:00:02,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:02,760 INFO L93 Difference]: Finished difference Result 243 states and 364 transitions. [2025-03-17 06:00:02,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:00:02,761 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2025-03-17 06:00:02,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:02,762 INFO L225 Difference]: With dead ends: 243 [2025-03-17 06:00:02,762 INFO L226 Difference]: Without dead ends: 123 [2025-03-17 06:00:02,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 156 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-17 06:00:02,764 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:02,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 520 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:02,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-17 06:00:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-17 06:00:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 101 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:00:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 183 transitions. [2025-03-17 06:00:02,782 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 183 transitions. Word has length 155 [2025-03-17 06:00:02,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:02,785 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 183 transitions. [2025-03-17 06:00:02,785 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:00:02,785 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 183 transitions. [2025-03-17 06:00:02,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 06:00:02,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:02,789 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:02,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:00:02,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 06:00:02,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:02,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:02,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1019227446, now seen corresponding path program 1 times [2025-03-17 06:00:02,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:02,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035879278] [2025-03-17 06:00:02,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:02,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:03,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 06:00:03,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 06:00:03,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:03,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:03,702 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 06:00:03,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:03,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035879278] [2025-03-17 06:00:03,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035879278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:00:03,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419831057] [2025-03-17 06:00:03,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:03,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:03,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:03,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:00:03,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:00:03,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 06:00:04,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 06:00:04,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:04,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:04,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:00:04,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:00:04,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:04,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419831057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:04,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:00:04,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 06:00:04,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476402837] [2025-03-17 06:00:04,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:04,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:00:04,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:04,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:00:04,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:04,079 INFO L87 Difference]: Start difference. First operand 123 states and 183 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:00:04,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:04,182 INFO L93 Difference]: Finished difference Result 248 states and 369 transitions. [2025-03-17 06:00:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:00:04,184 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2025-03-17 06:00:04,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:04,186 INFO L225 Difference]: With dead ends: 248 [2025-03-17 06:00:04,186 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 06:00:04,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:04,187 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:04,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 687 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:00:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 06:00:04,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-17 06:00:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:00:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 186 transitions. [2025-03-17 06:00:04,211 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 186 transitions. Word has length 157 [2025-03-17 06:00:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:04,212 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 186 transitions. [2025-03-17 06:00:04,212 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:00:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 186 transitions. [2025-03-17 06:00:04,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:00:04,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:04,218 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:04,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 06:00:04,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:04,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:04,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:04,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1721107278, now seen corresponding path program 1 times [2025-03-17 06:00:04,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:04,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017718874] [2025-03-17 06:00:04,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:04,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:04,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:00:04,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:00:04,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:04,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:00:07,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:07,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017718874] [2025-03-17 06:00:07,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017718874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:07,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:07,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:00:07,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630805895] [2025-03-17 06:00:07,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:07,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:00:07,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:07,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:00:07,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:07,653 INFO L87 Difference]: Start difference. First operand 126 states and 186 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:00:08,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:08,873 INFO L93 Difference]: Finished difference Result 427 states and 628 transitions. [2025-03-17 06:00:08,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:00:08,873 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 158 [2025-03-17 06:00:08,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:08,875 INFO L225 Difference]: With dead ends: 427 [2025-03-17 06:00:08,875 INFO L226 Difference]: Without dead ends: 302 [2025-03-17 06:00:08,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:00:08,877 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 294 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:08,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 632 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 06:00:08,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-17 06:00:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 209. [2025-03-17 06:00:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 166 states have (on average 1.3855421686746987) internal successors, (230), 166 states have internal predecessors, (230), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 06:00:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 310 transitions. [2025-03-17 06:00:08,905 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 310 transitions. Word has length 158 [2025-03-17 06:00:08,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:08,905 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 310 transitions. [2025-03-17 06:00:08,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:00:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 310 transitions. [2025-03-17 06:00:08,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 06:00:08,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:08,907 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:08,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:00:08,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:08,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:08,908 INFO L85 PathProgramCache]: Analyzing trace with hash -22494036, now seen corresponding path program 1 times [2025-03-17 06:00:08,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:08,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650851099] [2025-03-17 06:00:08,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:08,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:08,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 06:00:08,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 06:00:08,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:08,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 06:00:10,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:10,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650851099] [2025-03-17 06:00:10,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650851099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:00:10,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666216023] [2025-03-17 06:00:10,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:10,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:10,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:10,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:00:10,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 06:00:10,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 06:00:10,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 06:00:10,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:10,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:10,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 06:00:10,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:11,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:00:11,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:00:11,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:11,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2025-03-17 06:00:11,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:11,446 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 47 treesize of output 17 [2025-03-17 06:00:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 357 proven. 18 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-03-17 06:00:11,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:00:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 06:00:12,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666216023] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:00:12,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:00:12,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 15] total 33 [2025-03-17 06:00:12,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852518104] [2025-03-17 06:00:12,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:00:12,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 06:00:12,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:12,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 06:00:12,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 06:00:12,892 INFO L87 Difference]: Start difference. First operand 209 states and 310 transitions. Second operand has 33 states, 30 states have (on average 4.966666666666667) internal successors, (149), 33 states have internal predecessors, (149), 8 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 5 states have call predecessors, (47), 8 states have call successors, (47) [2025-03-17 06:00:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:20,376 INFO L93 Difference]: Finished difference Result 562 states and 805 transitions. [2025-03-17 06:00:20,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-17 06:00:20,377 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 4.966666666666667) internal successors, (149), 33 states have internal predecessors, (149), 8 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 5 states have call predecessors, (47), 8 states have call successors, (47) Word has length 159 [2025-03-17 06:00:20,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:20,381 INFO L225 Difference]: With dead ends: 562 [2025-03-17 06:00:20,386 INFO L226 Difference]: Without dead ends: 418 [2025-03-17 06:00:20,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=807, Invalid=5355, Unknown=0, NotChecked=0, Total=6162 [2025-03-17 06:00:20,392 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 1044 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 3266 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 3526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 3266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:20,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 1747 Invalid, 3526 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [260 Valid, 3266 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-17 06:00:20,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-17 06:00:20,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 244. [2025-03-17 06:00:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 197 states have (on average 1.3705583756345177) internal successors, (270), 197 states have internal predecessors, (270), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 06:00:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 350 transitions. [2025-03-17 06:00:20,415 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 350 transitions. Word has length 159 [2025-03-17 06:00:20,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:20,415 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 350 transitions. [2025-03-17 06:00:20,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 4.966666666666667) internal successors, (149), 33 states have internal predecessors, (149), 8 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 5 states have call predecessors, (47), 8 states have call successors, (47) [2025-03-17 06:00:20,416 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 350 transitions. [2025-03-17 06:00:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 06:00:20,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:20,418 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:20,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 06:00:20,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:20,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:20,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:20,620 INFO L85 PathProgramCache]: Analyzing trace with hash -794676172, now seen corresponding path program 1 times [2025-03-17 06:00:20,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:20,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810120595] [2025-03-17 06:00:20,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:20,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:20,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 06:00:20,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 06:00:20,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:20,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:00:20,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1309570525] [2025-03-17 06:00:20,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:20,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:20,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:20,974 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:00:20,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 06:00:21,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 06:00:21,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 06:00:21,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:21,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:21,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-17 06:00:21,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:21,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 27 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2025-03-17 06:00:21,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:21,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:00:22,112 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-17 06:00:22,329 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 26 treesize of output 14 [2025-03-17 06:00:22,416 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 26 treesize of output 14 [2025-03-17 06:00:22,480 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 26 treesize of output 14 [2025-03-17 06:00:22,549 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 26 treesize of output 14 [2025-03-17 06:00:22,620 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 26 treesize of output 14 [2025-03-17 06:00:22,726 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 26 treesize of output 14 [2025-03-17 06:00:22,956 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 26 treesize of output 14 [2025-03-17 06:00:23,252 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 26 treesize of output 14 [2025-03-17 06:00:23,411 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 343 proven. 39 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 06:00:23,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:00:24,279 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 06:00:24,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:24,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810120595] [2025-03-17 06:00:24,280 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 06:00:24,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309570525] [2025-03-17 06:00:24,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309570525] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:00:24,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:00:24,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-17 06:00:24,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264657876] [2025-03-17 06:00:24,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:00:24,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:00:24,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:24,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:00:24,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:00:24,286 INFO L87 Difference]: Start difference. First operand 244 states and 350 transitions. Second operand has 15 states, 13 states have (on average 9.461538461538462) internal successors, (123), 15 states have internal predecessors, (123), 6 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 6 states have call successors, (40) [2025-03-17 06:00:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:26,895 INFO L93 Difference]: Finished difference Result 488 states and 692 transitions. [2025-03-17 06:00:26,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 06:00:26,896 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.461538461538462) internal successors, (123), 15 states have internal predecessors, (123), 6 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 6 states have call successors, (40) Word has length 160 [2025-03-17 06:00:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:26,899 INFO L225 Difference]: With dead ends: 488 [2025-03-17 06:00:26,899 INFO L226 Difference]: Without dead ends: 320 [2025-03-17 06:00:26,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=218, Invalid=652, Unknown=0, NotChecked=0, Total=870 [2025-03-17 06:00:26,901 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 797 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:26,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 523 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-17 06:00:26,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-17 06:00:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 309. [2025-03-17 06:00:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 255 states have (on average 1.3529411764705883) internal successors, (345), 256 states have internal predecessors, (345), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 06:00:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 433 transitions. [2025-03-17 06:00:26,941 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 433 transitions. Word has length 160 [2025-03-17 06:00:26,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:26,941 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 433 transitions. [2025-03-17 06:00:26,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.461538461538462) internal successors, (123), 15 states have internal predecessors, (123), 6 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 6 states have call successors, (40) [2025-03-17 06:00:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 433 transitions. [2025-03-17 06:00:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 06:00:26,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:26,944 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:26,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 06:00:27,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:27,148 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:27,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:27,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1129678774, now seen corresponding path program 1 times [2025-03-17 06:00:27,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:27,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031049048] [2025-03-17 06:00:27,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:27,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:27,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 06:00:27,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 06:00:27,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:27,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:00:27,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [417761620] [2025-03-17 06:00:27,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:27,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:27,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:27,365 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:00:27,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 06:00:27,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 06:00:29,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 06:00:29,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:29,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:00:29,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:00:29,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 06:00:30,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 06:00:30,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:30,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:00:31,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:00:31,015 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:00:31,016 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:00:31,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 06:00:31,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:31,222 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:31,298 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:00:31,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:00:31 BoogieIcfgContainer [2025-03-17 06:00:31,308 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:00:31,308 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:00:31,308 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:00:31,309 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:00:31,309 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:00:00" (3/4) ... [2025-03-17 06:00:31,311 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:00:31,312 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:00:31,318 INFO L158 Benchmark]: Toolchain (without parser) took 31632.77ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 133.3MB in the beginning and 325.2MB in the end (delta: -191.9MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2025-03-17 06:00:31,318 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:00:31,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.22ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 116.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:00:31,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.09ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 112.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:00:31,319 INFO L158 Benchmark]: Boogie Preprocessor took 59.53ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 109.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:00:31,319 INFO L158 Benchmark]: IcfgBuilder took 740.46ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 72.2MB in the end (delta: 37.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:00:31,319 INFO L158 Benchmark]: TraceAbstraction took 30430.41ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 71.5MB in the beginning and 325.3MB in the end (delta: -253.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:00:31,319 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 411.0MB. Free memory was 325.3MB in the beginning and 325.2MB in the end (delta: 129.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:00:31,320 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.22ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 116.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.09ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 112.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.53ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 109.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 740.46ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 72.2MB in the end (delta: 37.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30430.41ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 71.5MB in the beginning and 325.3MB in the end (delta: -253.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 411.0MB. Free memory was 325.3MB in the beginning and 325.2MB in the end (delta: 129.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someUnaryDOUBLEoperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 72. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L57] unsigned char last_1_WrapperStruct00_var_1_16 = 10; [L132] isInitial = 1 [L133] FCALL initially() [L134] COND TRUE 1 [L135] CALL updateLastVariables() [L125] EXPR WrapperStruct00.var_1_16 [L125] last_1_WrapperStruct00_var_1_16 = WrapperStruct00.var_1_16 [L135] RET updateLastVariables() [L136] CALL updateVariables() [L92] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ulong() [L93] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L94] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L95] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ulong() [L96] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L97] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L98] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L99] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L102] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L103] EXPR WrapperStruct00.var_1_6 [L103] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_6 [L103] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L103] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L104] WrapperStruct00.var_1_7 = __VERIFIER_nondet_float() [L105] EXPR WrapperStruct00.var_1_7 [L105] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_7 [L105] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L105] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L106] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L107] EXPR WrapperStruct00.var_1_8 [L107] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_8 [L107] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L107] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L108] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L109] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L110] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L112] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L113] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L114] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L115] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L116] WrapperStruct00.var_1_17 = __VERIFIER_nondet_ushort() [L117] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L118] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L119] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_17 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_17 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L120] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L121] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L122] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L136] RET updateVariables() [L137] CALL step() [L61] signed long int stepLocal_1 = last_1_WrapperStruct00_var_1_16; [L62] EXPR WrapperStruct00.var_1_3 [L62] unsigned long int stepLocal_0 = WrapperStruct00.var_1_3; [L63] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10, stepLocal_0=2941876007, stepLocal_1=10] [L63] COND TRUE stepLocal_1 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16) [L64] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10, stepLocal_0=2941876007] [L64] EXPR (((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10, stepLocal_0=2941876007] [L64] COND FALSE !(stepLocal_0 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) [L69] EXPR WrapperStruct00.var_1_9 [L69] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_9 [L72] EXPR WrapperStruct00.var_1_1 [L72] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L72] COND FALSE !(WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) [L75] EXPR WrapperStruct00.var_1_2 [L75] EXPR WrapperStruct00.var_1_5 [L75] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L75] EXPR WrapperStruct00.var_1_2 & (WrapperStruct00.var_1_5 / WrapperStruct00.var_1_17) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L75] unsigned long int stepLocal_2 = WrapperStruct00.var_1_2 & (WrapperStruct00.var_1_5 / WrapperStruct00.var_1_17); [L76] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10, stepLocal_2=0] [L76] COND FALSE !(stepLocal_2 > WrapperStruct00.var_1_3) [L83] EXPR WrapperStruct00.var_1_18 [L83] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_18 [L85] WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L85] COND FALSE !(WrapperStruct00.var_1_10) [L137] RET step() [L138] CALL, EXPR property() [L128] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR (last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1 [L128] EXPR WrapperStruct00.var_1_3 [L128] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR (((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR (WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) [L128] EXPR WrapperStruct00.var_1_1 [L128] EXPR WrapperStruct00.var_1_9 [L128] EXPR (WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR (last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR ((last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((unsigned char) (! (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_12)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR (((last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((unsigned char) (! (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_12)))) : 1)) && (WrapperStruct00.var_1_10 ? ((WrapperStruct00.var_1_12 || (WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_13 == ((signed short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR ((((last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((unsigned char) (! (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_12)))) : 1)) && (WrapperStruct00.var_1_10 ? ((WrapperStruct00.var_1_12 || (WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_13 == ((signed short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : 1) : 1)) && (((WrapperStruct00.var_1_2 & (WrapperStruct00.var_1_5 / WrapperStruct00.var_1_17)) > WrapperStruct00.var_1_3) ? ((! WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128-L129] return ((((last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((unsigned char) (! (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_12)))) : 1)) && (WrapperStruct00.var_1_10 ? ((WrapperStruct00.var_1_12 || (WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_13 == ((signed short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : 1) : 1)) && (((WrapperStruct00.var_1_2 & (WrapperStruct00.var_1_5 / WrapperStruct00.var_1_17)) > WrapperStruct00.var_1_3) ? ((! WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18))) ; [L138] RET, EXPR property() [L138] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 205 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.3s, OverallIterations: 7, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2162 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2135 mSDsluCounter, 4288 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3452 mSDsCounter, 524 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4892 IncrementalHoareTripleChecker+Invalid, 5416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 524 mSolverCounterUnsat, 836 mSDtfsCounter, 4892 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1225 GetRequests, 1098 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1648 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=6, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 278 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 2050 NumberOfCodeBlocks, 2050 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1877 ConstructedInterpolants, 0 QuantifiedInterpolants, 7869 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2642 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 8803/9120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 06:00:31,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-s_file-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 e1284d110aec8c9fc5da783d4e31facf9c686765dccc1866ab0c2c6ea65f610a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:00:34,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:00:34,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:00:34,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:00:34,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:00:34,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:00:34,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:00:34,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:00:34,858 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:00:34,858 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:00:34,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:00:34,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:00:34,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:00:34,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:00:34,860 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:00:34,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:00:34,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:00:34,860 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:00:34,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:00:34,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:00:34,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:00:34,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:00:34,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:00:34,861 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:00:34,861 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:00:34,861 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:00:34,861 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:00:34,861 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:00:34,861 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:00:34,861 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:00:34,861 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:00:34,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:00:34,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:00:34,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:00:34,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:00:34,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:00:34,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:00:34,862 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:00:34,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:00:34,862 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:00:34,862 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:00:34,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:00:34,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:00:34,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:00:34,862 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:00:34,862 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 -> e1284d110aec8c9fc5da783d4e31facf9c686765dccc1866ab0c2c6ea65f610a [2025-03-17 06:00:35,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:00:35,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:00:35,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:00:35,336 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:00:35,336 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:00:35,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i [2025-03-17 06:00:37,174 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/277ca1255/7cd8326dabb34b88885c89f076afbebc/FLAGfc2f005f8 [2025-03-17 06:00:37,576 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:00:37,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i [2025-03-17 06:00:37,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/277ca1255/7cd8326dabb34b88885c89f076afbebc/FLAGfc2f005f8 [2025-03-17 06:00:37,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/277ca1255/7cd8326dabb34b88885c89f076afbebc [2025-03-17 06:00:37,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:00:37,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:00:37,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:00:37,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:00:37,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:00:37,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:00:37" (1/1) ... [2025-03-17 06:00:37,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@753bd246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:37, skipping insertion in model container [2025-03-17 06:00:37,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:00:37" (1/1) ... [2025-03-17 06:00:37,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:00:37,935 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-s_file-64.i[916,929] [2025-03-17 06:00:38,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:00:38,051 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:00:38,068 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-s_file-64.i[916,929] [2025-03-17 06:00:38,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:00:38,161 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:00:38,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:38 WrapperNode [2025-03-17 06:00:38,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:00:38,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:00:38,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:00:38,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:00:38,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:38" (1/1) ... [2025-03-17 06:00:38,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:38" (1/1) ... [2025-03-17 06:00:38,264 INFO L138 Inliner]: procedures = 40, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 496 [2025-03-17 06:00:38,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:00:38,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:00:38,270 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:00:38,270 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:00:38,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:38" (1/1) ... [2025-03-17 06:00:38,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:38" (1/1) ... [2025-03-17 06:00:38,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:38" (1/1) ... [2025-03-17 06:00:38,342 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2025-03-17 06:00:38,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:38" (1/1) ... [2025-03-17 06:00:38,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:38" (1/1) ... [2025-03-17 06:00:38,360 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:38" (1/1) ... [2025-03-17 06:00:38,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:38" (1/1) ... [2025-03-17 06:00:38,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:38" (1/1) ... [2025-03-17 06:00:38,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:38" (1/1) ... [2025-03-17 06:00:38,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:00:38,393 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:00:38,393 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:00:38,393 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:00:38,396 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:38" (1/1) ... [2025-03-17 06:00:38,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:00:38,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:38,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:00:38,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:00:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:00:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 06:00:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 06:00:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-17 06:00:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-17 06:00:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 06:00:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 06:00:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:00:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:00:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:00:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:00:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 06:00:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 06:00:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 06:00:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 06:00:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 06:00:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 06:00:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-17 06:00:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-17 06:00:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 06:00:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 06:00:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 06:00:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 06:00:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:00:38,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:00:38,469 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:00:38,469 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:00:38,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 06:00:38,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 06:00:38,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:00:38,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:00:38,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:00:38,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:00:38,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 06:00:38,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 06:00:38,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 06:00:38,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 06:00:38,646 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:00:38,651 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:00:43,042 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L128: havoc property_#t~mem91#1;havoc property_#t~ite105#1;havoc property_#t~mem95#1;havoc property_#t~mem92#1;havoc property_#t~ite94#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~short113#1;havoc property_#t~mem114#1;havoc property_#t~ite124#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short119#1;havoc property_#t~ite123#1;havoc property_#t~mem122#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short125#1;havoc property_#t~mem128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite138#1;havoc property_#t~mem130#1;havoc property_#t~ite135#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short139#1; [2025-03-17 06:00:43,113 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-03-17 06:00:43,113 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:00:43,122 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:00:43,122 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:00:43,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:00:43 BoogieIcfgContainer [2025-03-17 06:00:43,123 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:00:43,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:00:43,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:00:43,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:00:43,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:00:37" (1/3) ... [2025-03-17 06:00:43,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3797aed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:00:43, skipping insertion in model container [2025-03-17 06:00:43,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:38" (2/3) ... [2025-03-17 06:00:43,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3797aed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:00:43, skipping insertion in model container [2025-03-17 06:00:43,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:00:43" (3/3) ... [2025-03-17 06:00:43,130 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-64.i [2025-03-17 06:00:43,143 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:00:43,144 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-64.i that has 2 procedures, 115 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:00:43,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:00:43,219 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;@4019de55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:00:43,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:00:43,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 93 states have internal predecessors, (133), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:00:43,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 06:00:43,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:43,256 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:43,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:43,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:43,265 INFO L85 PathProgramCache]: Analyzing trace with hash 465359308, now seen corresponding path program 1 times [2025-03-17 06:00:43,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:43,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086794861] [2025-03-17 06:00:43,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:43,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:43,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:43,287 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:43,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 06:00:43,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 06:00:43,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 06:00:43,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:43,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:43,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:00:43,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:43,890 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-03-17 06:00:43,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:43,892 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:43,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086794861] [2025-03-17 06:00:43,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086794861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:43,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:43,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:00:43,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519152039] [2025-03-17 06:00:43,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:43,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:00:43,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:43,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:00:43,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:00:43,939 INFO L87 Difference]: Start difference. First operand has 115 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 93 states have internal predecessors, (133), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:00:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:43,970 INFO L93 Difference]: Finished difference Result 227 states and 364 transitions. [2025-03-17 06:00:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:00:43,976 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 153 [2025-03-17 06:00:43,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:43,982 INFO L225 Difference]: With dead ends: 227 [2025-03-17 06:00:43,982 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 06:00:43,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:00:43,988 INFO L435 NwaCegarLoop]: 169 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, 169 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-17 06:00:43,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:44,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 06:00:44,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-17 06:00:44,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:00:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 169 transitions. [2025-03-17 06:00:44,056 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 169 transitions. Word has length 153 [2025-03-17 06:00:44,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:44,062 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 169 transitions. [2025-03-17 06:00:44,062 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 06:00:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 169 transitions. [2025-03-17 06:00:44,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 06:00:44,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:44,065 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:44,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 06:00:44,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:44,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:44,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:44,267 INFO L85 PathProgramCache]: Analyzing trace with hash -513077604, now seen corresponding path program 1 times [2025-03-17 06:00:44,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:44,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784075437] [2025-03-17 06:00:44,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:44,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:44,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:44,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:44,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 06:00:44,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 06:00:44,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 06:00:44,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:44,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:44,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:00:44,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:00:44,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:44,923 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:44,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784075437] [2025-03-17 06:00:44,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784075437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:44,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:44,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:00:44,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125380927] [2025-03-17 06:00:44,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:44,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:00:44,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:44,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:00:44,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:00:44,933 INFO L87 Difference]: Start difference. First operand 113 states and 169 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:00:45,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:45,369 INFO L93 Difference]: Finished difference Result 227 states and 340 transitions. [2025-03-17 06:00:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:00:45,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2025-03-17 06:00:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:45,372 INFO L225 Difference]: With dead ends: 227 [2025-03-17 06:00:45,372 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 06:00:45,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:00:45,373 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:45,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 490 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:00:45,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 06:00:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-17 06:00:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:00:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2025-03-17 06:00:45,397 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 153 [2025-03-17 06:00:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:45,401 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2025-03-17 06:00:45,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:00:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2025-03-17 06:00:45,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 06:00:45,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:45,410 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:45,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:00:45,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:45,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:45,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:45,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1288246582, now seen corresponding path program 1 times [2025-03-17 06:00:45,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:45,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091566354] [2025-03-17 06:00:45,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:45,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:45,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:45,622 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:45,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 06:00:45,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 06:00:45,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 06:00:45,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:45,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:46,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:00:46,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 06:00:46,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:46,215 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:46,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091566354] [2025-03-17 06:00:46,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091566354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:46,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:46,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:00:46,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317241859] [2025-03-17 06:00:46,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:46,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:00:46,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:46,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:00:46,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:00:46,219 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:00:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:46,404 INFO L93 Difference]: Finished difference Result 232 states and 345 transitions. [2025-03-17 06:00:46,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:00:46,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2025-03-17 06:00:46,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:46,413 INFO L225 Difference]: With dead ends: 232 [2025-03-17 06:00:46,413 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 06:00:46,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:00:46,414 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:46,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 647 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:00:46,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 06:00:46,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-17 06:00:46,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 06:00:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2025-03-17 06:00:46,421 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 155 [2025-03-17 06:00:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:46,421 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2025-03-17 06:00:46,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 06:00:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2025-03-17 06:00:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:00:46,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:46,422 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:46,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-17 06:00:46,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:46,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:46,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:46,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1084646211, now seen corresponding path program 1 times [2025-03-17 06:00:46,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:46,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062671291] [2025-03-17 06:00:46,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:46,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:46,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:46,634 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:46,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 06:00:46,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:00:47,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:00:47,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:47,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:47,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 06:00:47,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:47,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:00:47,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:00:47,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:00:47,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 31 [2025-03-17 06:00:47,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:47,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 17 [2025-03-17 06:00:47,874 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 8 treesize of output 1 [2025-03-17 06:00:48,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 06:00:48,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 06:00:48,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 06:00:48,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 06:00:49,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2025-03-17 06:00:49,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2025-03-17 06:00:49,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:49,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-03-17 06:00:50,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:50,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-03-17 06:00:50,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:50,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-03-17 06:00:50,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:50,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 11 [2025-03-17 06:00:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 447 proven. 51 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-03-17 06:00:50,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:00:52,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-17 06:00:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 06:00:52,085 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:52,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062671291] [2025-03-17 06:00:52,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062671291] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:00:52,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:00:52,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2025-03-17 06:00:52,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445140115] [2025-03-17 06:00:52,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:00:52,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:00:52,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:52,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:00:52,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:00:52,088 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 15 states, 13 states have (on average 8.384615384615385) internal successors, (109), 15 states have internal predecessors, (109), 7 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) [2025-03-17 06:00:54,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:00:55,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:00:57,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:01:10,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:01:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:11,145 INFO L93 Difference]: Finished difference Result 378 states and 547 transitions. [2025-03-17 06:01:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 06:01:11,147 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 8.384615384615385) internal successors, (109), 15 states have internal predecessors, (109), 7 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) Word has length 156 [2025-03-17 06:01:11,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:11,152 INFO L225 Difference]: With dead ends: 378 [2025-03-17 06:01:11,152 INFO L226 Difference]: Without dead ends: 261 [2025-03-17 06:01:11,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2025-03-17 06:01:11,159 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 593 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:01:11,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 477 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 17.8s Time] [2025-03-17 06:01:11,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-17 06:01:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249. [2025-03-17 06:01:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 201 states have (on average 1.3681592039800996) internal successors, (275), 202 states have internal predecessors, (275), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 06:01:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 359 transitions. [2025-03-17 06:01:11,244 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 359 transitions. Word has length 156 [2025-03-17 06:01:11,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:11,245 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 359 transitions. [2025-03-17 06:01:11,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 8.384615384615385) internal successors, (109), 15 states have internal predecessors, (109), 7 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) [2025-03-17 06:01:11,245 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 359 transitions. [2025-03-17 06:01:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:01:11,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:11,250 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:01:11,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 06:01:11,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:11,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:11,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:11,452 INFO L85 PathProgramCache]: Analyzing trace with hash 864259589, now seen corresponding path program 1 times [2025-03-17 06:01:11,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:01:11,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543828817] [2025-03-17 06:01:11,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:11,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:11,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:01:11,457 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:01:11,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 06:01:11,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:01:15,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:01:15,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:15,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:15,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 06:01:15,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:01:15,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:01:15,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:01:15,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:01:15,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 31 [2025-03-17 06:01:16,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:16,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 17 [2025-03-17 06:01:16,224 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 8 treesize of output 1 [2025-03-17 06:01:16,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-17 06:01:16,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-17 06:01:17,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-17 06:01:17,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-03-17 06:01:21,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:21,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-03-17 06:01:22,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:22,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-03-17 06:01:22,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:22,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2025-03-17 06:01:23,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:23,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2025-03-17 06:01:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-03-17 06:01:24,749 INFO L312 TraceCheckSpWp]: Computing backward predicates...