./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.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 e1a2bcd66d87d7ad4b83fe3db6aada8f59760a9add58b963015dd7d640f76e7f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:53:39,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:53:39,175 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:53:39,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:53:39,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:53:39,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:53:39,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:53:39,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:53:39,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:53:39,204 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:53:39,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:53:39,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:53:39,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:53:39,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:53:39,205 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:53:39,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:53:39,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:53:39,205 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:53:39,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:53:39,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:53:39,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:53:39,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:53:39,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:53:39,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:53:39,205 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:53:39,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:53:39,205 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:53:39,205 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:53:39,205 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:53:39,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:53:39,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:53:39,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:53:39,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:53:39,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:53:39,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:53:39,206 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:53:39,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:53:39,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:53:39,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:53:39,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:53:39,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:53:39,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:53:39,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:53:39,206 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 -> e1a2bcd66d87d7ad4b83fe3db6aada8f59760a9add58b963015dd7d640f76e7f [2025-03-04 01:53:39,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:53:39,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:53:39,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:53:39,435 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:53:39,435 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:53:39,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i [2025-03-04 01:53:40,541 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d3ac577/c686e775247d401fa95ee8dbefcd4ef2/FLAG975b1811e [2025-03-04 01:53:40,751 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:53:40,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i [2025-03-04 01:53:40,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d3ac577/c686e775247d401fa95ee8dbefcd4ef2/FLAG975b1811e [2025-03-04 01:53:41,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d3ac577/c686e775247d401fa95ee8dbefcd4ef2 [2025-03-04 01:53:41,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:53:41,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:53:41,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:53:41,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:53:41,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:53:41,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:53:41" (1/1) ... [2025-03-04 01:53:41,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b0f992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:41, skipping insertion in model container [2025-03-04 01:53:41,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:53:41" (1/1) ... [2025-03-04 01:53:41,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:53:41,223 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i[917,930] [2025-03-04 01:53:41,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:53:41,270 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:53:41,277 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i[917,930] [2025-03-04 01:53:41,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:53:41,321 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:53:41,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:41 WrapperNode [2025-03-04 01:53:41,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:53:41,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:53:41,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:53:41,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:53:41,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:41" (1/1) ... [2025-03-04 01:53:41,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:41" (1/1) ... [2025-03-04 01:53:41,369 INFO L138 Inliner]: procedures = 30, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 493 [2025-03-04 01:53:41,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:53:41,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:53:41,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:53:41,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:53:41,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:41" (1/1) ... [2025-03-04 01:53:41,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:41" (1/1) ... [2025-03-04 01:53:41,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:41" (1/1) ... [2025-03-04 01:53:41,383 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:53:41,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:41" (1/1) ... [2025-03-04 01:53:41,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:41" (1/1) ... [2025-03-04 01:53:41,391 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:41" (1/1) ... [2025-03-04 01:53:41,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:41" (1/1) ... [2025-03-04 01:53:41,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:41" (1/1) ... [2025-03-04 01:53:41,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:41" (1/1) ... [2025-03-04 01:53:41,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:53:41,405 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:53:41,405 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:53:41,405 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:53:41,406 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:41" (1/1) ... [2025-03-04 01:53:41,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:53:41,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:53:41,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:53:41,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:53:41,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:53:41,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:53:41,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:53:41,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:53:41,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:53:41,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:53:41,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:53:41,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:53:41,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:53:41,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:53:41,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:53:41,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:53:41,559 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:53:41,561 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:53:41,950 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: havoc property_#t~ite98#1;havoc property_#t~mem86#1;havoc property_#t~ite92#1;havoc property_#t~mem91#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem97#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~ite103#1;havoc property_#t~mem102#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~ite126#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem117#1;havoc property_#t~mem113#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem116#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1; [2025-03-04 01:53:41,988 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-03-04 01:53:41,989 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:53:41,997 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:53:41,999 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:53:41,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:53:41 BoogieIcfgContainer [2025-03-04 01:53:41,999 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:53:42,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:53:42,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:53:42,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:53:42,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:53:41" (1/3) ... [2025-03-04 01:53:42,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74105b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:53:42, skipping insertion in model container [2025-03-04 01:53:42,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:41" (2/3) ... [2025-03-04 01:53:42,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74105b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:53:42, skipping insertion in model container [2025-03-04 01:53:42,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:53:41" (3/3) ... [2025-03-04 01:53:42,007 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-65.i [2025-03-04 01:53:42,017 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:53:42,018 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-65.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:53:42,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:53:42,065 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;@4c4b1ab2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:53:42,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:53:42,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:53:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:53:42,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:42,078 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:42,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:42,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:42,083 INFO L85 PathProgramCache]: Analyzing trace with hash -364474889, now seen corresponding path program 1 times [2025-03-04 01:53:42,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:42,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117169737] [2025-03-04 01:53:42,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:42,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:42,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:53:42,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:53:42,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:42,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 01:53:42,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:42,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117169737] [2025-03-04 01:53:42,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117169737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:53:42,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736252502] [2025-03-04 01:53:42,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:42,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:53:42,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:53:42,377 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:53:42,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:53:42,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:53:42,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:53:42,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:42,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:42,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:53:42,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:42,644 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 01:53:42,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:53:42,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736252502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:42,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:53:42,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:53:42,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729035549] [2025-03-04 01:53:42,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:42,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:53:42,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:42,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:53:42,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:53:42,671 INFO L87 Difference]: Start difference. First operand has 112 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:53:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:42,698 INFO L93 Difference]: Finished difference Result 218 states and 334 transitions. [2025-03-04 01:53:42,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:53:42,699 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-03-04 01:53:42,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:42,705 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:53:42,705 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 01:53:42,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:53:42,712 INFO L435 NwaCegarLoop]: 157 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, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:42,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:53:42,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 01:53:42,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-04 01:53:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:53:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-04 01:53:42,754 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 112 [2025-03-04 01:53:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:42,754 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-04 01:53:42,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:53:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-04 01:53:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:53:42,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:42,758 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:42,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:53:42,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:53:42,962 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:42,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:42,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1795427476, now seen corresponding path program 1 times [2025-03-04 01:53:42,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:42,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305754201] [2025-03-04 01:53:42,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:42,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:43,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:53:43,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:53:43,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:43,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:53:43,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:43,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305754201] [2025-03-04 01:53:43,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305754201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:43,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:43,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:53:43,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812643776] [2025-03-04 01:53:43,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:43,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:53:43,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:43,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:53:43,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:53:43,249 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:53:43,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:43,285 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2025-03-04 01:53:43,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:53:43,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-03-04 01:53:43,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:43,287 INFO L225 Difference]: With dead ends: 217 [2025-03-04 01:53:43,287 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 01:53:43,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:53:43,288 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:43,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:53:43,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 01:53:43,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-04 01:53:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:53:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-03-04 01:53:43,298 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 112 [2025-03-04 01:53:43,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:43,299 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-03-04 01:53:43,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:53:43,299 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-03-04 01:53:43,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:53:43,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:43,300 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:43,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:53:43,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:43,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:43,301 INFO L85 PathProgramCache]: Analyzing trace with hash -829026251, now seen corresponding path program 1 times [2025-03-04 01:53:43,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:43,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762706114] [2025-03-04 01:53:43,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:43,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:43,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:53:43,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:53:43,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:43,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 01:53:43,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:43,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762706114] [2025-03-04 01:53:43,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762706114] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:53:43,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258549130] [2025-03-04 01:53:43,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:43,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:53:43,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:53:43,570 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:53:43,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:53:43,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:53:43,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:53:43,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:43,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:43,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:53:43,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:53:43,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:53:43,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258549130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:43,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:53:43,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-04 01:53:43,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272762099] [2025-03-04 01:53:43,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:43,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:53:43,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:43,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:53:43,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:53:43,785 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:53:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:43,817 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2025-03-04 01:53:43,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:53:43,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-03-04 01:53:43,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:43,819 INFO L225 Difference]: With dead ends: 222 [2025-03-04 01:53:43,821 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 01:53:43,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:53:43,822 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:43,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 451 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:53:43,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 01:53:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-04 01:53:43,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:53:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-03-04 01:53:43,832 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 112 [2025-03-04 01:53:43,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:43,833 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-03-04 01:53:43,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:53:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-03-04 01:53:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:53:43,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:43,836 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:43,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:53:44,036 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,SelfDestructingSolverStorable2 [2025-03-04 01:53:44,037 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:44,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:44,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1658486582, now seen corresponding path program 1 times [2025-03-04 01:53:44,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:44,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314944086] [2025-03-04 01:53:44,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:44,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:44,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:53:44,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:53:44,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:44,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 01:53:44,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314944086] [2025-03-04 01:53:44,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314944086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:53:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27369451] [2025-03-04 01:53:44,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:44,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:53:44,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:53:44,243 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:53:44,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:53:44,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:53:44,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:53:44,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:44,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:44,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:53:44,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:44,441 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:53:44,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:53:44,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27369451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:44,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:53:44,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-04 01:53:44,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078014420] [2025-03-04 01:53:44,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:44,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:53:44,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:44,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:53:44,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:53:44,443 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:53:44,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:44,465 INFO L93 Difference]: Finished difference Result 226 states and 323 transitions. [2025-03-04 01:53:44,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:53:44,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-03-04 01:53:44,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:44,467 INFO L225 Difference]: With dead ends: 226 [2025-03-04 01:53:44,468 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:53:44,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:53:44,469 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:44,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 452 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:53:44,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:53:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-04 01:53:44,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3823529411764706) internal successors, (141), 102 states have internal predecessors, (141), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:53:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2025-03-04 01:53:44,478 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 112 [2025-03-04 01:53:44,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:44,478 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2025-03-04 01:53:44,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:53:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2025-03-04 01:53:44,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:53:44,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:44,479 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:44,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:53:44,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:53:44,681 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:44,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:44,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1748977033, now seen corresponding path program 1 times [2025-03-04 01:53:44,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:44,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390110951] [2025-03-04 01:53:44,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:44,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:44,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:53:44,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:53:44,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:44,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:44,866 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 01:53:44,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:44,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390110951] [2025-03-04 01:53:44,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390110951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:53:44,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247535917] [2025-03-04 01:53:44,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:44,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:53:44,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:53:44,869 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:53:44,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:53:44,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:53:45,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:53:45,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:45,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:45,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:53:45,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:53:45,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:53:45,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247535917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:45,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:53:45,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-04 01:53:45,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669976740] [2025-03-04 01:53:45,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:45,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:53:45,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:45,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:53:45,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:53:45,070 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:53:45,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:45,090 INFO L93 Difference]: Finished difference Result 230 states and 327 transitions. [2025-03-04 01:53:45,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:53:45,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-03-04 01:53:45,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:45,091 INFO L225 Difference]: With dead ends: 230 [2025-03-04 01:53:45,091 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 01:53:45,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:53:45,092 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:45,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:53:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 01:53:45,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-04 01:53:45,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 104 states have (on average 1.375) internal successors, (143), 104 states have internal predecessors, (143), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:53:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 165 transitions. [2025-03-04 01:53:45,103 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 165 transitions. Word has length 112 [2025-03-04 01:53:45,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:45,104 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 165 transitions. [2025-03-04 01:53:45,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:53:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 165 transitions. [2025-03-04 01:53:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:53:45,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:45,105 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:45,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:53:45,309 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-04 01:53:45,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:45,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:45,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1748053512, now seen corresponding path program 1 times [2025-03-04 01:53:45,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:45,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954761899] [2025-03-04 01:53:45,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:45,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:45,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:53:45,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:53:45,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:45,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 01:53:45,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:45,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954761899] [2025-03-04 01:53:45,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954761899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:53:45,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130346030] [2025-03-04 01:53:45,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:45,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:53:45,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:53:45,458 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:53:45,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:53:45,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:53:45,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:53:45,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:45,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:45,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:53:45,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:53:45,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:53:45,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130346030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:45,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:53:45,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:53:45,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942207916] [2025-03-04 01:53:45,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:45,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:53:45,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:45,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:53:45,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:53:45,682 INFO L87 Difference]: Start difference. First operand 117 states and 165 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:53:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:45,703 INFO L93 Difference]: Finished difference Result 234 states and 331 transitions. [2025-03-04 01:53:45,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:53:45,703 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-03-04 01:53:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:45,707 INFO L225 Difference]: With dead ends: 234 [2025-03-04 01:53:45,708 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 01:53:45,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:53:45,708 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:45,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:53:45,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 01:53:45,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-04 01:53:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 107 states have internal predecessors, (146), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:53:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2025-03-04 01:53:45,712 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 112 [2025-03-04 01:53:45,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:45,713 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2025-03-04 01:53:45,713 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:53:45,713 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2025-03-04 01:53:45,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:53:45,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:45,714 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:45,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:53:45,918 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-04 01:53:45,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:45,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:45,919 INFO L85 PathProgramCache]: Analyzing trace with hash -198456480, now seen corresponding path program 1 times [2025-03-04 01:53:45,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:45,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915788649] [2025-03-04 01:53:45,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:45,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:45,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:53:45,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:53:45,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:45,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:53:47,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:47,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915788649] [2025-03-04 01:53:47,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915788649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:47,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:47,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:53:47,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672133426] [2025-03-04 01:53:47,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:47,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:53:47,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:47,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:53:47,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:53:47,433 INFO L87 Difference]: Start difference. First operand 120 states and 168 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-04 01:53:47,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:47,832 INFO L93 Difference]: Finished difference Result 291 states and 404 transitions. [2025-03-04 01:53:47,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:53:47,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 112 [2025-03-04 01:53:47,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:47,834 INFO L225 Difference]: With dead ends: 291 [2025-03-04 01:53:47,834 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 01:53:47,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:53:47,834 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 237 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:47,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 514 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:53:47,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 01:53:47,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 122. [2025-03-04 01:53:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 109 states have (on average 1.3577981651376148) internal successors, (148), 109 states have internal predecessors, (148), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:53:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 170 transitions. [2025-03-04 01:53:47,845 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 170 transitions. Word has length 112 [2025-03-04 01:53:47,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:47,845 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 170 transitions. [2025-03-04 01:53:47,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-04 01:53:47,845 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 170 transitions. [2025-03-04 01:53:47,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:53:47,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:47,846 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:47,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:53:47,847 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:47,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:47,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1594956225, now seen corresponding path program 1 times [2025-03-04 01:53:47,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:47,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864835643] [2025-03-04 01:53:47,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:47,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:47,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:53:47,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:53:47,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:47,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:53:47,900 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:53:47,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:53:47,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:53:47,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:47,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:53:47,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:53:47,994 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:53:47,994 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:53:47,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:53:47,999 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:48,107 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:53:48,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:53:48 BoogieIcfgContainer [2025-03-04 01:53:48,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:53:48,112 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:53:48,112 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:53:48,112 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:53:48,113 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:53:41" (3/4) ... [2025-03-04 01:53:48,114 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:53:48,115 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:53:48,115 INFO L158 Benchmark]: Toolchain (without parser) took 6996.15ms. Allocated memory was 201.3MB in the beginning and 276.8MB in the end (delta: 75.5MB). Free memory was 158.8MB in the beginning and 102.1MB in the end (delta: 56.7MB). Peak memory consumption was 135.4MB. Max. memory is 16.1GB. [2025-03-04 01:53:48,115 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:53:48,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.72ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 143.4MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:53:48,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.56ms. Allocated memory is still 201.3MB. Free memory was 143.4MB in the beginning and 140.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:53:48,116 INFO L158 Benchmark]: Boogie Preprocessor took 34.48ms. Allocated memory is still 201.3MB. Free memory was 140.1MB in the beginning and 137.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:53:48,117 INFO L158 Benchmark]: IcfgBuilder took 594.47ms. Allocated memory is still 201.3MB. Free memory was 137.7MB in the beginning and 103.6MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:53:48,117 INFO L158 Benchmark]: TraceAbstraction took 6108.60ms. Allocated memory was 201.3MB in the beginning and 276.8MB in the end (delta: 75.5MB). Free memory was 103.0MB in the beginning and 102.1MB in the end (delta: 853.0kB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. [2025-03-04 01:53:48,117 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 276.8MB. Free memory was 102.1MB in the beginning and 102.1MB in the end (delta: 54.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:53:48,118 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.73ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.72ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 143.4MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.56ms. Allocated memory is still 201.3MB. Free memory was 143.4MB in the beginning and 140.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.48ms. Allocated memory is still 201.3MB. Free memory was 140.1MB in the beginning and 137.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 594.47ms. Allocated memory is still 201.3MB. Free memory was 137.7MB in the beginning and 103.6MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6108.60ms. Allocated memory was 201.3MB in the beginning and 276.8MB in the end (delta: 75.5MB). Free memory was 103.0MB in the beginning and 102.1MB in the end (delta: 853.0kB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 276.8MB. Free memory was 102.1MB in the beginning and 102.1MB in the end (delta: 54.1kB). Peak memory consumption was 8.4MB. 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 someBinaryArithmeticDOUBLEoperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someUnaryFLOAToperation at line 121. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1000000000.1, 1, 8.2, -32, 100.5, 25.25, 63.6, 0.0, 0.8, -8, 8, 2, 50, 0 }; [L55] float* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L57] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L58] signed long int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L59] double* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L60] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L61] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L62] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L63] double* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L64] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L65] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L66] unsigned short int* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L67] unsigned short int* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L68] unsigned short int* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); [L69] double last_1_WrapperStruct00_var_1_9 = 100.5; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=0, last_1_WrapperStruct00_var_1_9=201/2] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L118] EXPR WrapperStruct00.var_1_9 [L118] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L97] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L98] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L99] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L100] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L101] EXPR WrapperStruct00.var_1_4 [L101] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_4 [L101] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L101] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L102] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_12 [L103] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_12 [L103] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L103] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L104] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L105] EXPR WrapperStruct00.var_1_13 [L105] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_13 [L105] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L105] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L106] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L107] EXPR WrapperStruct00.var_1_14 [L107] EXPR WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_14 [L107] EXPR WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR (WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L108] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_15 [L109] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_15 [L109] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L109] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L110] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L111] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L112] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L113] WrapperStruct00.var_1_19 = __VERIFIER_nondet_ushort() [L114] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L115] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L129] RET updateVariables() [L130] CALL step() [L73] COND TRUE 0.625f > last_1_WrapperStruct00_var_1_9 [L74] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L74] COND FALSE !((*(WrapperStruct00_var_1_3_Pointer))) [L80] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L80] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_17_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L81] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L82] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L82] (*(WrapperStruct00_var_1_20_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L83] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L83] COND FALSE !((*(WrapperStruct00_var_1_3_Pointer))) [L88] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L88] COND TRUE (*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_1_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L89] (*(WrapperStruct00_var_1_9_Pointer)) = ((*(WrapperStruct00_var_1_13_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer)))) [L92] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L92] COND FALSE !((*(WrapperStruct00_var_1_4_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR (0.625f > last_1_WrapperStruct00_var_1_9) ? ((*(WrapperStruct00_var_1_3_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L121] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))) [L121] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L121] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L121] EXPR (0.625f > last_1_WrapperStruct00_var_1_9) ? ((*(WrapperStruct00_var_1_3_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L121] EXPR ((0.625f > last_1_WrapperStruct00_var_1_9) ? ((*(WrapperStruct00_var_1_3_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_4_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_20_Pointer))) > (-64)) ? ((*(WrapperStruct00_var_1_20_Pointer))) : (-64))) + (((*(WrapperStruct00_var_1_20_Pointer)) + -2) + (*(WrapperStruct00_var_1_18_Pointer)))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L121] EXPR (((0.625f > last_1_WrapperStruct00_var_1_9) ? ((*(WrapperStruct00_var_1_3_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_4_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_20_Pointer))) > (-64)) ? ((*(WrapperStruct00_var_1_20_Pointer))) : (-64))) + (((*(WrapperStruct00_var_1_20_Pointer)) + -2) + (*(WrapperStruct00_var_1_18_Pointer)))))) : 1)) && ((*(WrapperStruct00_var_1_3_Pointer)) ? (((*(WrapperStruct00_var_1_20_Pointer)) >= (((*(WrapperStruct00_var_1_18_Pointer)) - (*(WrapperStruct00_var_1_20_Pointer))) * 64)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((((((*(WrapperStruct00_var_1_12_Pointer))) < (50.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (50.5))) - (*(WrapperStruct00_var_1_13_Pointer))))) : 1) : (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer)))))) : 1)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L121] EXPR ((((0.625f > last_1_WrapperStruct00_var_1_9) ? ((*(WrapperStruct00_var_1_3_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_4_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_20_Pointer))) > (-64)) ? ((*(WrapperStruct00_var_1_20_Pointer))) : (-64))) + (((*(WrapperStruct00_var_1_20_Pointer)) + -2) + (*(WrapperStruct00_var_1_18_Pointer)))))) : 1)) && ((*(WrapperStruct00_var_1_3_Pointer)) ? (((*(WrapperStruct00_var_1_20_Pointer)) >= (((*(WrapperStruct00_var_1_18_Pointer)) - (*(WrapperStruct00_var_1_20_Pointer))) * 64)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((((((*(WrapperStruct00_var_1_12_Pointer))) < (50.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (50.5))) - (*(WrapperStruct00_var_1_13_Pointer))))) : 1) : (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer)))))) : 1))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L121] EXPR (((((0.625f > last_1_WrapperStruct00_var_1_9) ? ((*(WrapperStruct00_var_1_3_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_4_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_20_Pointer))) > (-64)) ? ((*(WrapperStruct00_var_1_20_Pointer))) : (-64))) + (((*(WrapperStruct00_var_1_20_Pointer)) + -2) + (*(WrapperStruct00_var_1_18_Pointer)))))) : 1)) && ((*(WrapperStruct00_var_1_3_Pointer)) ? (((*(WrapperStruct00_var_1_20_Pointer)) >= (((*(WrapperStruct00_var_1_18_Pointer)) - (*(WrapperStruct00_var_1_20_Pointer))) * 64)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((((((*(WrapperStruct00_var_1_12_Pointer))) < (50.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (50.5))) - (*(WrapperStruct00_var_1_13_Pointer))))) : 1) : (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer)))))) : 1))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L121] EXPR ((((((0.625f > last_1_WrapperStruct00_var_1_9) ? ((*(WrapperStruct00_var_1_3_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_4_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_20_Pointer))) > (-64)) ? ((*(WrapperStruct00_var_1_20_Pointer))) : (-64))) + (((*(WrapperStruct00_var_1_20_Pointer)) + -2) + (*(WrapperStruct00_var_1_18_Pointer)))))) : 1)) && ((*(WrapperStruct00_var_1_3_Pointer)) ? (((*(WrapperStruct00_var_1_20_Pointer)) >= (((*(WrapperStruct00_var_1_18_Pointer)) - (*(WrapperStruct00_var_1_20_Pointer))) * 64)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((((((*(WrapperStruct00_var_1_12_Pointer))) < (50.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (50.5))) - (*(WrapperStruct00_var_1_13_Pointer))))) : 1) : (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer)))))) : 1))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L121-L122] return ((((((0.625f > last_1_WrapperStruct00_var_1_9) ? ((*(WrapperStruct00_var_1_3_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_4_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_20_Pointer))) > (-64)) ? ((*(WrapperStruct00_var_1_20_Pointer))) : (-64))) + (((*(WrapperStruct00_var_1_20_Pointer)) + -2) + (*(WrapperStruct00_var_1_18_Pointer)))))) : 1)) && ((*(WrapperStruct00_var_1_3_Pointer)) ? (((*(WrapperStruct00_var_1_20_Pointer)) >= (((*(WrapperStruct00_var_1_18_Pointer)) - (*(WrapperStruct00_var_1_20_Pointer))) * 64)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((((((*(WrapperStruct00_var_1_12_Pointer))) < (50.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (50.5))) - (*(WrapperStruct00_var_1_13_Pointer))))) : 1) : (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer)))))) : 1))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer)))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 241 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 240 mSDsluCounter, 3083 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2002 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 376 IncrementalHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 1081 mSDtfsCounter, 376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 613 GetRequests, 573 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=7, InterpolantAutomatonStates: 30, 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, 7 MinimizatonAttempts, 55 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1456 NumberOfCodeBlocks, 1456 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1332 ConstructedInterpolants, 0 QuantifiedInterpolants, 2686 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2388 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 2500/2640 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-04 01:53:48,136 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-sp_file-65.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 e1a2bcd66d87d7ad4b83fe3db6aada8f59760a9add58b963015dd7d640f76e7f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:53:49,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:53:50,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:53:50,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:53:50,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:53:50,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:53:50,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:53:50,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:53:50,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:53:50,075 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:53:50,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:53:50,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:53:50,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:53:50,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:53:50,077 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:53:50,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:53:50,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:53:50,078 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:53:50,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:53:50,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:53:50,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:53:50,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:53:50,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:53:50,078 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:53:50,078 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:53:50,079 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:53:50,079 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:53:50,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:53:50,079 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:53:50,079 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:53:50,079 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:53:50,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:53:50,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:53:50,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:53:50,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:53:50,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:53:50,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:53:50,080 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:53:50,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:53:50,080 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:53:50,080 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:53:50,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:53:50,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:53:50,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:53:50,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:53:50,080 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 -> e1a2bcd66d87d7ad4b83fe3db6aada8f59760a9add58b963015dd7d640f76e7f [2025-03-04 01:53:50,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:53:50,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:53:50,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:53:50,330 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:53:50,330 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:53:50,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i [2025-03-04 01:53:51,509 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefbe66f9/7d408a8d499244878d0a10fa7ef7a965/FLAG85841d287 [2025-03-04 01:53:51,699 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:53:51,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i [2025-03-04 01:53:51,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefbe66f9/7d408a8d499244878d0a10fa7ef7a965/FLAG85841d287 [2025-03-04 01:53:51,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefbe66f9/7d408a8d499244878d0a10fa7ef7a965 [2025-03-04 01:53:51,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:53:51,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:53:51,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:53:51,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:53:51,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:53:51,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:53:51" (1/1) ... [2025-03-04 01:53:51,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bf8838e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:51, skipping insertion in model container [2025-03-04 01:53:51,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:53:51" (1/1) ... [2025-03-04 01:53:51,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:53:51,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i[917,930] [2025-03-04 01:53:51,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:53:51,930 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:53:51,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i[917,930] [2025-03-04 01:53:51,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:53:52,006 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:53:52,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:52 WrapperNode [2025-03-04 01:53:52,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:53:52,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:53:52,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:53:52,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:53:52,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:52" (1/1) ... [2025-03-04 01:53:52,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:52" (1/1) ... [2025-03-04 01:53:52,062 INFO L138 Inliner]: procedures = 40, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 491 [2025-03-04 01:53:52,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:53:52,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:53:52,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:53:52,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:53:52,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:52" (1/1) ... [2025-03-04 01:53:52,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:52" (1/1) ... [2025-03-04 01:53:52,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:52" (1/1) ... [2025-03-04 01:53:52,113 INFO L175 MemorySlicer]: Split 124 memory accesses to 2 slices as follows [2, 122]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2025-03-04 01:53:52,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:52" (1/1) ... [2025-03-04 01:53:52,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:52" (1/1) ... [2025-03-04 01:53:52,134 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:52" (1/1) ... [2025-03-04 01:53:52,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:52" (1/1) ... [2025-03-04 01:53:52,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:52" (1/1) ... [2025-03-04 01:53:52,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:52" (1/1) ... [2025-03-04 01:53:52,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:53:52,149 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:53:52,149 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:53:52,149 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:53:52,150 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:52" (1/1) ... [2025-03-04 01:53:52,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:53:52,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:53:52,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:53:52,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:53:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:53:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:53:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:53:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-04 01:53:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-04 01:53:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:53:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:53:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:53:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:53:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:53:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:53:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:53:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:53:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:53:52,193 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:53:52,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:53:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:53:52,302 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:53:52,303 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:53:57,156 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: havoc property_#t~ite98#1;havoc property_#t~mem86#1;havoc property_#t~ite92#1;havoc property_#t~mem91#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem97#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~ite103#1;havoc property_#t~mem102#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~ite126#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem117#1;havoc property_#t~mem113#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem116#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1; [2025-03-04 01:53:57,183 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-03-04 01:53:57,183 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:53:57,189 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:53:57,190 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:53:57,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:53:57 BoogieIcfgContainer [2025-03-04 01:53:57,190 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:53:57,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:53:57,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:53:57,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:53:57,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:53:51" (1/3) ... [2025-03-04 01:53:57,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cd5b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:53:57, skipping insertion in model container [2025-03-04 01:53:57,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:52" (2/3) ... [2025-03-04 01:53:57,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cd5b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:53:57, skipping insertion in model container [2025-03-04 01:53:57,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:53:57" (3/3) ... [2025-03-04 01:53:57,197 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-65.i [2025-03-04 01:53:57,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:53:57,207 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-65.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:53:57,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:53:57,259 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;@59b8bea0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:53:57,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:53:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:53:57,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:53:57,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:57,269 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:57,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:57,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:57,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1227440889, now seen corresponding path program 1 times [2025-03-04 01:53:57,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:53:57,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917115564] [2025-03-04 01:53:57,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:57,282 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-04 01:53:57,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:53:57,284 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-04 01:53:57,285 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-04 01:53:57,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:53:57,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:53:57,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:57,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:57,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:53:57,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-04 01:53:57,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:53:57,654 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:53:57,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917115564] [2025-03-04 01:53:57,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917115564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:57,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:57,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:53:57,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107340135] [2025-03-04 01:53:57,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:57,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:53:57,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:53:57,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:53:57,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:53:57,673 INFO L87 Difference]: Start difference. First operand has 112 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:53:57,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:57,690 INFO L93 Difference]: Finished difference Result 218 states and 334 transitions. [2025-03-04 01:53:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:53:57,691 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-03-04 01:53:57,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:57,695 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:53:57,695 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 01:53:57,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:53:57,699 INFO L435 NwaCegarLoop]: 157 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, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:57,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:53:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 01:53:57,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-04 01:53:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:53:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-04 01:53:57,731 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 112 [2025-03-04 01:53:57,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:57,731 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-04 01:53:57,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:53:57,732 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-04 01:53:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:53:57,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:57,737 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:57,748 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-04 01:53:57,938 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-04 01:53:57,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:57,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:57,939 INFO L85 PathProgramCache]: Analyzing trace with hash -907624042, now seen corresponding path program 1 times [2025-03-04 01:53:57,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:53:57,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857209811] [2025-03-04 01:53:57,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:57,956 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-04 01:53:57,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:53:57,958 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-04 01:53:57,960 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-04 01:53:58,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:53:58,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:53:58,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:58,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:58,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:53:58,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:58,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 10 [2025-03-04 01:53:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:53:58,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:53:58,387 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:53:58,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857209811] [2025-03-04 01:53:58,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857209811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:58,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:58,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:53:58,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045393378] [2025-03-04 01:53:58,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:58,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:53:58,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:53:58,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:53:58,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:53:58,391 INFO L87 Difference]: Start difference. First operand 109 states and 157 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:54:01,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:07,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:07,526 INFO L93 Difference]: Finished difference Result 257 states and 368 transitions. [2025-03-04 01:54:07,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:54:07,527 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-03-04 01:54:07,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:07,529 INFO L225 Difference]: With dead ends: 257 [2025-03-04 01:54:07,530 INFO L226 Difference]: Without dead ends: 151 [2025-03-04 01:54:07,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:54:07,531 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 56 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:07,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 419 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2025-03-04 01:54:07,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-04 01:54:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 114. [2025-03-04 01:54:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:54:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-03-04 01:54:07,540 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 112 [2025-03-04 01:54:07,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:07,541 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-03-04 01:54:07,541 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:54:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-03-04 01:54:07,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:54:07,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:07,542 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:54:07,553 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 (3)] Ended with exit code 0 [2025-03-04 01:54:07,743 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-04 01:54:07,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:07,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:07,744 INFO L85 PathProgramCache]: Analyzing trace with hash 641972990, now seen corresponding path program 1 times [2025-03-04 01:54:07,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:54:07,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439732711] [2025-03-04 01:54:07,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:07,744 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-04 01:54:07,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:54:07,747 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-04 01:54:07,748 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-04 01:54:07,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:54:08,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:54:08,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:08,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:08,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 01:54:08,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:54:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:54:08,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:54:08,124 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:54:08,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439732711] [2025-03-04 01:54:08,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439732711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:54:08,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:54:08,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:54:08,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815257541] [2025-03-04 01:54:08,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:54:08,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:54:08,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:54:08,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:54:08,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:54:08,125 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:54:11,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:12,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:14,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:16,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:17,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:18,264 INFO L93 Difference]: Finished difference Result 270 states and 388 transitions. [2025-03-04 01:54:18,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:54:18,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-03-04 01:54:18,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:18,266 INFO L225 Difference]: With dead ends: 270 [2025-03-04 01:54:18,266 INFO L226 Difference]: Without dead ends: 159 [2025-03-04 01:54:18,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:54:18,266 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 59 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:18,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 245 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2025-03-04 01:54:18,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-04 01:54:18,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 130. [2025-03-04 01:54:18,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:54:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 186 transitions. [2025-03-04 01:54:18,274 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 186 transitions. Word has length 112 [2025-03-04 01:54:18,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:18,274 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 186 transitions. [2025-03-04 01:54:18,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:54:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 186 transitions. [2025-03-04 01:54:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:54:18,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:18,275 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:54:18,286 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 (4)] Ended with exit code 0 [2025-03-04 01:54:18,475 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-04 01:54:18,476 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:18,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:18,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1990843509, now seen corresponding path program 1 times [2025-03-04 01:54:18,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:54:18,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288571682] [2025-03-04 01:54:18,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:18,477 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-04 01:54:18,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:54:18,479 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-04 01:54:18,480 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-04 01:54:18,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:54:18,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:54:18,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:18,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:18,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:54:18,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:54:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:54:18,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:54:18,907 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:54:18,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288571682] [2025-03-04 01:54:18,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288571682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:54:18,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:54:18,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:54:18,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885294327] [2025-03-04 01:54:18,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:54:18,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:54:18,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:54:18,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:54:18,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:54:18,908 INFO L87 Difference]: Start difference. First operand 130 states and 186 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:54:18,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:18,972 INFO L93 Difference]: Finished difference Result 260 states and 373 transitions. [2025-03-04 01:54:18,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:54:18,973 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-03-04 01:54:18,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:18,974 INFO L225 Difference]: With dead ends: 260 [2025-03-04 01:54:18,974 INFO L226 Difference]: Without dead ends: 133 [2025-03-04 01:54:18,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:54:18,975 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:18,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:54:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-04 01:54:18,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-04 01:54:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 120 states have internal predecessors, (167), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:54:18,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 189 transitions. [2025-03-04 01:54:18,981 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 189 transitions. Word has length 112 [2025-03-04 01:54:18,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:18,982 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 189 transitions. [2025-03-04 01:54:18,982 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:54:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 189 transitions. [2025-03-04 01:54:18,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:54:18,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:18,983 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:54:18,997 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-04 01:54:19,184 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-04 01:54:19,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:19,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash 300463623, now seen corresponding path program 1 times [2025-03-04 01:54:19,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:54:19,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020692127] [2025-03-04 01:54:19,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:19,185 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-04 01:54:19,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:54:19,187 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-04 01:54:19,188 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-04 01:54:19,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:54:19,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:54:19,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:19,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:19,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:54:19,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:54:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:54:19,523 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:54:19,523 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:54:19,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020692127] [2025-03-04 01:54:19,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020692127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:54:19,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:54:19,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:54:19,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649477184] [2025-03-04 01:54:19,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:54:19,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:54:19,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:54:19,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:54:19,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:54:19,524 INFO L87 Difference]: Start difference. First operand 133 states and 189 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:54:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:19,581 INFO L93 Difference]: Finished difference Result 268 states and 382 transitions. [2025-03-04 01:54:19,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:54:19,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2025-03-04 01:54:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:19,582 INFO L225 Difference]: With dead ends: 268 [2025-03-04 01:54:19,582 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 01:54:19,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:54:19,583 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:19,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 592 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:54:19,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 01:54:19,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2025-03-04 01:54:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 124 states have internal predecessors, (171), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:54:19,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 193 transitions. [2025-03-04 01:54:19,593 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 193 transitions. Word has length 113 [2025-03-04 01:54:19,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:19,593 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 193 transitions. [2025-03-04 01:54:19,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:54:19,593 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 193 transitions. [2025-03-04 01:54:19,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:54:19,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:19,594 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:54:19,606 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 (6)] Ended with exit code 0 [2025-03-04 01:54:19,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-04 01:54:19,795 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:19,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:19,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1506990840, now seen corresponding path program 1 times [2025-03-04 01:54:19,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:54:19,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900745816] [2025-03-04 01:54:19,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:19,796 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-04 01:54:19,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:54:19,797 INFO L229 MonitoredProcess]: Starting monitored process 7 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-04 01:54:19,798 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 (7)] Waiting until timeout for monitored process [2025-03-04 01:54:19,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:54:20,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:54:20,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:20,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:20,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:54:20,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:54:20,122 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:54:20,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:54:20,123 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:54:20,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900745816] [2025-03-04 01:54:20,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900745816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:54:20,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:54:20,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:54:20,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474192733] [2025-03-04 01:54:20,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:54:20,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:54:20,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:54:20,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:54:20,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:54:20,124 INFO L87 Difference]: Start difference. First operand 137 states and 193 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:54:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:20,187 INFO L93 Difference]: Finished difference Result 274 states and 387 transitions. [2025-03-04 01:54:20,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:54:20,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2025-03-04 01:54:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:20,188 INFO L225 Difference]: With dead ends: 274 [2025-03-04 01:54:20,188 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 01:54:20,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:54:20,189 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:20,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 730 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:54:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 01:54:20,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-03-04 01:54:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 126 states have (on average 1.373015873015873) internal successors, (173), 126 states have internal predecessors, (173), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:54:20,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 195 transitions. [2025-03-04 01:54:20,194 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 195 transitions. Word has length 113 [2025-03-04 01:54:20,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:20,194 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 195 transitions. [2025-03-04 01:54:20,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:54:20,194 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 195 transitions. [2025-03-04 01:54:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:54:20,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:20,195 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:54:20,205 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 (7)] Ended with exit code 0 [2025-03-04 01:54:20,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-04 01:54:20,396 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:20,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:20,396 INFO L85 PathProgramCache]: Analyzing trace with hash -619487159, now seen corresponding path program 1 times [2025-03-04 01:54:20,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:54:20,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347750164] [2025-03-04 01:54:20,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:20,397 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-04 01:54:20,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:54:20,399 INFO L229 MonitoredProcess]: Starting monitored process 8 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-04 01:54:20,400 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 (8)] Waiting until timeout for monitored process [2025-03-04 01:54:20,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:54:20,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:54:20,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:20,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:20,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:54:20,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:54:20,718 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:54:20,718 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:54:20,718 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:54:20,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347750164] [2025-03-04 01:54:20,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347750164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:54:20,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:54:20,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:54:20,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329720155] [2025-03-04 01:54:20,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:54:20,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:54:20,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:54:20,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:54:20,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:54:20,720 INFO L87 Difference]: Start difference. First operand 139 states and 195 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:54:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:20,778 INFO L93 Difference]: Finished difference Result 278 states and 391 transitions. [2025-03-04 01:54:20,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:54:20,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2025-03-04 01:54:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:20,779 INFO L225 Difference]: With dead ends: 278 [2025-03-04 01:54:20,779 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 01:54:20,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:54:20,780 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:20,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 869 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:54:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 01:54:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2025-03-04 01:54:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 128 states have (on average 1.3671875) internal successors, (175), 128 states have internal predecessors, (175), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:54:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 197 transitions. [2025-03-04 01:54:20,784 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 197 transitions. Word has length 113 [2025-03-04 01:54:20,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:20,785 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 197 transitions. [2025-03-04 01:54:20,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:54:20,785 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 197 transitions. [2025-03-04 01:54:20,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:54:20,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:20,786 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:54:20,796 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 (8)] Ended with exit code 0 [2025-03-04 01:54:20,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-04 01:54:20,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:20,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:20,987 INFO L85 PathProgramCache]: Analyzing trace with hash -618563638, now seen corresponding path program 1 times [2025-03-04 01:54:20,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:54:20,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016542945] [2025-03-04 01:54:20,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:20,987 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-04 01:54:20,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:54:20,989 INFO L229 MonitoredProcess]: Starting monitored process 9 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-04 01:54:20,990 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 (9)] Waiting until timeout for monitored process [2025-03-04 01:54:21,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:54:21,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:54:21,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:21,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:21,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:54:21,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:54:21,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:54:21,463 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 173 treesize of output 65 [2025-03-04 01:54:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:54:21,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:54:21,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:54:21,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016542945] [2025-03-04 01:54:21,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016542945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:54:21,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:54:21,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:54:21,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943514124] [2025-03-04 01:54:21,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:54:21,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:54:21,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:54:21,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:54:21,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:54:21,501 INFO L87 Difference]: Start difference. First operand 141 states and 197 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:54:23,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:25,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:28,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:28,787 INFO L93 Difference]: Finished difference Result 280 states and 392 transitions. [2025-03-04 01:54:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:54:28,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2025-03-04 01:54:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:28,788 INFO L225 Difference]: With dead ends: 280 [2025-03-04 01:54:28,788 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 01:54:28,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:54:28,789 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 137 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:28,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 383 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2025-03-04 01:54:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 01:54:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2025-03-04 01:54:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 128 states have (on average 1.359375) internal successors, (174), 128 states have internal predecessors, (174), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:54:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 196 transitions. [2025-03-04 01:54:28,795 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 196 transitions. Word has length 113 [2025-03-04 01:54:28,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:28,796 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 196 transitions. [2025-03-04 01:54:28,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:54:28,796 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 196 transitions. [2025-03-04 01:54:28,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:54:28,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:28,798 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:54:28,808 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 (9)] Ended with exit code 0 [2025-03-04 01:54:28,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-04 01:54:28,998 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:28,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:28,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1747621576, now seen corresponding path program 1 times [2025-03-04 01:54:28,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:54:28,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430895786] [2025-03-04 01:54:28,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:28,999 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-04 01:54:28,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:54:29,001 INFO L229 MonitoredProcess]: Starting monitored process 10 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-04 01:54:29,001 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 (10)] Waiting until timeout for monitored process [2025-03-04 01:54:29,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:54:29,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:54:29,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:29,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:29,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:54:29,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:54:29,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:54:29,448 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 173 treesize of output 65 [2025-03-04 01:54:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-04 01:54:29,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:54:29,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:54:29,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430895786] [2025-03-04 01:54:29,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430895786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:54:29,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:54:29,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:54:29,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501499863] [2025-03-04 01:54:29,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:54:29,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:54:29,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:54:29,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:54:29,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:54:29,476 INFO L87 Difference]: Start difference. First operand 141 states and 196 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:54:33,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:34,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:38,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:38,498 INFO L93 Difference]: Finished difference Result 280 states and 390 transitions. [2025-03-04 01:54:38,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:54:38,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2025-03-04 01:54:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:38,500 INFO L225 Difference]: With dead ends: 280 [2025-03-04 01:54:38,500 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 01:54:38,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:54:38,500 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 128 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:38,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 379 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2025-03-04 01:54:38,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 01:54:38,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2025-03-04 01:54:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 128 states have (on average 1.3515625) internal successors, (173), 128 states have internal predecessors, (173), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:54:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 195 transitions. [2025-03-04 01:54:38,506 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 195 transitions. Word has length 115 [2025-03-04 01:54:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:38,506 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 195 transitions. [2025-03-04 01:54:38,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:54:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 195 transitions. [2025-03-04 01:54:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:54:38,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:38,508 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:54:38,519 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 (10)] Ended with exit code 0 [2025-03-04 01:54:38,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-04 01:54:38,708 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:38,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:38,709 INFO L85 PathProgramCache]: Analyzing trace with hash -975039798, now seen corresponding path program 1 times [2025-03-04 01:54:38,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:54:38,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653220838] [2025-03-04 01:54:38,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:38,709 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-04 01:54:38,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:54:38,711 INFO L229 MonitoredProcess]: Starting monitored process 11 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-04 01:54:38,712 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 (11)] Waiting until timeout for monitored process [2025-03-04 01:54:38,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:54:39,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:54:39,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:39,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:39,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:54:39,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:54:39,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:54:39,215 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 175 treesize of output 67 [2025-03-04 01:54:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-04 01:54:39,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:54:39,246 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:54:39,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653220838] [2025-03-04 01:54:39,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653220838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:54:39,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:54:39,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:54:39,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895823752] [2025-03-04 01:54:39,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:54:39,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:54:39,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:54:39,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:54:39,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:54:39,247 INFO L87 Difference]: Start difference. First operand 141 states and 195 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:54:42,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:44,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:47,036 INFO L93 Difference]: Finished difference Result 280 states and 388 transitions. [2025-03-04 01:54:47,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:54:47,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2025-03-04 01:54:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:47,037 INFO L225 Difference]: With dead ends: 280 [2025-03-04 01:54:47,037 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 01:54:47,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:54:47,038 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 119 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:47,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 375 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2025-03-04 01:54:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 01:54:47,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2025-03-04 01:54:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 128 states have (on average 1.34375) internal successors, (172), 128 states have internal predecessors, (172), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:54:47,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 194 transitions. [2025-03-04 01:54:47,043 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 194 transitions. Word has length 117 [2025-03-04 01:54:47,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:47,043 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 194 transitions. [2025-03-04 01:54:47,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:54:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 194 transitions. [2025-03-04 01:54:47,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:54:47,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:47,044 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:54:47,056 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 (11)] Forceful destruction successful, exit code 0 [2025-03-04 01:54:47,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-04 01:54:47,245 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:47,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:47,246 INFO L85 PathProgramCache]: Analyzing trace with hash 237511624, now seen corresponding path program 1 times [2025-03-04 01:54:47,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:54:47,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962638517] [2025-03-04 01:54:47,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:47,246 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-04 01:54:47,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:54:47,248 INFO L229 MonitoredProcess]: Starting monitored process 12 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-04 01:54:47,249 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 (12)] Waiting until timeout for monitored process [2025-03-04 01:54:47,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:54:47,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:54:47,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:47,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:47,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:54:47,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:54:47,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:54:47,761 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 173 treesize of output 65 [2025-03-04 01:54:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-04 01:54:47,801 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:54:47,801 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:54:47,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962638517] [2025-03-04 01:54:47,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962638517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:54:47,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:54:47,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:54:47,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936471916] [2025-03-04 01:54:47,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:54:47,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:54:47,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:54:47,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:54:47,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:54:47,802 INFO L87 Difference]: Start difference. First operand 141 states and 194 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:54:50,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:52,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:53,940 INFO L93 Difference]: Finished difference Result 280 states and 386 transitions. [2025-03-04 01:54:53,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:54:53,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 119 [2025-03-04 01:54:53,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:53,941 INFO L225 Difference]: With dead ends: 280 [2025-03-04 01:54:53,941 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 01:54:53,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:54:53,942 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 110 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:53,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 369 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-03-04 01:54:53,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 01:54:53,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2025-03-04 01:54:53,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 128 states have (on average 1.3359375) internal successors, (171), 128 states have internal predecessors, (171), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:54:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 193 transitions. [2025-03-04 01:54:53,945 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 193 transitions. Word has length 119 [2025-03-04 01:54:53,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:53,946 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 193 transitions. [2025-03-04 01:54:53,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:54:53,946 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 193 transitions. [2025-03-04 01:54:53,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:54:53,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:53,946 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:54:53,957 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 (12)] Ended with exit code 0 [2025-03-04 01:54:54,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-04 01:54:54,147 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:54,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:54,147 INFO L85 PathProgramCache]: Analyzing trace with hash -330490422, now seen corresponding path program 1 times [2025-03-04 01:54:54,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:54:54,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272150334] [2025-03-04 01:54:54,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:54,148 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-04 01:54:54,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:54:54,150 INFO L229 MonitoredProcess]: Starting monitored process 13 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-04 01:54:54,151 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 (13)] Waiting until timeout for monitored process [2025-03-04 01:54:54,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:54:54,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:54:54,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:54,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:54,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 01:54:54,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:54:55,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:54:56,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2025-03-04 01:54:57,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2025-03-04 01:54:57,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-04 01:55:02,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2025-03-04 01:55:09,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-03-04 01:55:09,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-03-04 01:55:18,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 80 [2025-03-04 01:55:18,413 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 97 [2025-03-04 01:55:18,783 INFO L349 Elim1Store]: treesize reduction 302, result has 11.4 percent of original size [2025-03-04 01:55:18,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 128 treesize of output 214 [2025-03-04 01:55:19,025 INFO L173 IndexEqualityManager]: detected equality via solver