./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-41.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 cf57f6cdcf870de2612fde58ee5c1f342ba08bbc54728c19b9bea815b9a3fde0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:46:07,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:46:07,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:46:07,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:46:07,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:46:07,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:46:07,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:46:07,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:46:07,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:46:07,592 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:46:07,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:46:07,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:46:07,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:46:07,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:46:07,594 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:46:07,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:46:07,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:46:07,594 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:46:07,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:46:07,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:46:07,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:46:07,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:46:07,595 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:46:07,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:46:07,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:46:07,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:46:07,596 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 -> cf57f6cdcf870de2612fde58ee5c1f342ba08bbc54728c19b9bea815b9a3fde0 [2025-03-17 05:46:07,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:46:07,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:46:07,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:46:07,809 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:46:07,809 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:46:07,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-41.i [2025-03-17 05:46:08,902 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27fcf049a/da569f2f1a9042a388f6a5a3a00340cb/FLAGeb6db9bb3 [2025-03-17 05:46:09,151 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:46:09,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-41.i [2025-03-17 05:46:09,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27fcf049a/da569f2f1a9042a388f6a5a3a00340cb/FLAGeb6db9bb3 [2025-03-17 05:46:09,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27fcf049a/da569f2f1a9042a388f6a5a3a00340cb [2025-03-17 05:46:09,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:46:09,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:46:09,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:46:09,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:46:09,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:46:09,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:46:09" (1/1) ... [2025-03-17 05:46:09,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c0f257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:09, skipping insertion in model container [2025-03-17 05:46:09,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:46:09" (1/1) ... [2025-03-17 05:46:09,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:46:09,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-41.i[916,929] [2025-03-17 05:46:09,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:46:09,353 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:46:09,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-41.i[916,929] [2025-03-17 05:46:09,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:46:09,405 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:46:09,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:09 WrapperNode [2025-03-17 05:46:09,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:46:09,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:46:09,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:46:09,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:46:09,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:09" (1/1) ... [2025-03-17 05:46:09,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:09" (1/1) ... [2025-03-17 05:46:09,455 INFO L138 Inliner]: procedures = 29, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 427 [2025-03-17 05:46:09,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:46:09,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:46:09,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:46:09,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:46:09,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:09" (1/1) ... [2025-03-17 05:46:09,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:09" (1/1) ... [2025-03-17 05:46:09,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:09" (1/1) ... [2025-03-17 05:46:09,500 INFO L175 MemorySlicer]: Split 111 memory accesses to 13 slices as follows [2, 8, 12, 14, 6, 11, 6, 5, 10, 7, 7, 17, 6]. 15 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 3, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1]. [2025-03-17 05:46:09,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:09" (1/1) ... [2025-03-17 05:46:09,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:09" (1/1) ... [2025-03-17 05:46:09,520 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:09" (1/1) ... [2025-03-17 05:46:09,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:09" (1/1) ... [2025-03-17 05:46:09,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:09" (1/1) ... [2025-03-17 05:46:09,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:09" (1/1) ... [2025-03-17 05:46:09,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:46:09,528 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:46:09,528 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:46:09,528 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:46:09,529 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:09" (1/1) ... [2025-03-17 05:46:09,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:46:09,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:09,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:46:09,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:46:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:46:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:46:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:46:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:46:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:46:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:46:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:46:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:46:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-17 05:46:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-17 05:46:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-17 05:46:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-17 05:46:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-03-17 05:46:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-03-17 05:46:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:46:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:46:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:46:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:46:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:46:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:46:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:46:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:46:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:46:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:46:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:46:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 05:46:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 05:46:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:46:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:46:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:46:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:46:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:46:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:46:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:46:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-17 05:46:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-17 05:46:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-17 05:46:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-17 05:46:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-03-17 05:46:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-03-17 05:46:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:46:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:46:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:46:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:46:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:46:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:46:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:46:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:46:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:46:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:46:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:46:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 05:46:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 05:46:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:46:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:46:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:46:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:46:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:46:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:46:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:46:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-17 05:46:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-17 05:46:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-17 05:46:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-17 05:46:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-03-17 05:46:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-03-17 05:46:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:46:09,578 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:46:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:46:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:46:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:46:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:46:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:46:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:46:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:46:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:46:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:46:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:46:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:46:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 05:46:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 05:46:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:46:09,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:46:09,705 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:46:09,706 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:46:10,026 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite75#1;havoc property_#t~mem63#1;havoc property_#t~ite72#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~mem71#1;havoc property_#t~mem67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite89#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~short83#1;havoc property_#t~ite88#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~short90#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short97#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short108#1; [2025-03-17 05:46:10,058 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2025-03-17 05:46:10,058 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:46:10,067 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:46:10,067 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:46:10,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:10 BoogieIcfgContainer [2025-03-17 05:46:10,068 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:46:10,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:46:10,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:46:10,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:46:10,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:46:09" (1/3) ... [2025-03-17 05:46:10,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2546df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:46:10, skipping insertion in model container [2025-03-17 05:46:10,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:09" (2/3) ... [2025-03-17 05:46:10,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2546df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:46:10, skipping insertion in model container [2025-03-17 05:46:10,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:10" (3/3) ... [2025-03-17 05:46:10,075 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-41.i [2025-03-17 05:46:10,084 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:46:10,085 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-41.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:46:10,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:46:10,127 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;@4facf31d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:46:10,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:46:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 67 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:46:10,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 05:46:10,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:10,137 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:46:10,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:10,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:10,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1637005858, now seen corresponding path program 1 times [2025-03-17 05:46:10,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:10,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636217800] [2025-03-17 05:46:10,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:10,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:10,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 05:46:10,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 05:46:10,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:10,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 05:46:10,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:10,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636217800] [2025-03-17 05:46:10,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636217800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:10,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488296692] [2025-03-17 05:46:10,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:10,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:10,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:10,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:46:10,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:46:10,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 05:46:10,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 05:46:10,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:10,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:10,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:46:10,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 05:46:10,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:10,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488296692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:10,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:10,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:46:10,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384916293] [2025-03-17 05:46:10,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:10,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:46:10,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:10,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:46:10,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:46:10,617 INFO L87 Difference]: Start difference. First operand has 83 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 67 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:46:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:10,631 INFO L93 Difference]: Finished difference Result 159 states and 250 transitions. [2025-03-17 05:46:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:46:10,632 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2025-03-17 05:46:10,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:10,636 INFO L225 Difference]: With dead ends: 159 [2025-03-17 05:46:10,636 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 05:46:10,638 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-17 05:46:10,640 INFO L435 NwaCegarLoop]: 111 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, 111 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:10,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:10,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 05:46:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 05:46:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:46:10,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2025-03-17 05:46:10,664 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 110 [2025-03-17 05:46:10,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:10,664 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2025-03-17 05:46:10,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:46:10,665 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2025-03-17 05:46:10,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 05:46:10,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:10,666 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:46:10,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:46:10,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:46:10,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:10,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:10,868 INFO L85 PathProgramCache]: Analyzing trace with hash -647212900, now seen corresponding path program 1 times [2025-03-17 05:46:10,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:10,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637554388] [2025-03-17 05:46:10,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:10,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:10,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 05:46:10,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 05:46:10,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:10,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:46:11,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:11,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637554388] [2025-03-17 05:46:11,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637554388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:11,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:11,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:46:11,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035030853] [2025-03-17 05:46:11,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:11,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:46:11,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:11,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:46:11,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:46:11,179 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:46:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:11,210 INFO L93 Difference]: Finished difference Result 156 states and 225 transitions. [2025-03-17 05:46:11,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:46:11,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2025-03-17 05:46:11,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:11,215 INFO L225 Difference]: With dead ends: 156 [2025-03-17 05:46:11,215 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 05:46:11,216 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-17 05:46:11,217 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 313 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-17 05:46:11,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 313 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:11,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 05:46:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2025-03-17 05:46:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:46:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2025-03-17 05:46:11,226 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 110 [2025-03-17 05:46:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:11,230 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2025-03-17 05:46:11,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:46:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2025-03-17 05:46:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 05:46:11,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:11,231 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:46:11,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:46:11,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:11,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1840299933, now seen corresponding path program 1 times [2025-03-17 05:46:11,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:11,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849629540] [2025-03-17 05:46:11,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:11,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:11,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 05:46:11,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 05:46:11,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:11,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:46:11,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:11,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849629540] [2025-03-17 05:46:11,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849629540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:11,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:11,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:46:11,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230193001] [2025-03-17 05:46:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:11,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:46:11,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:11,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:46:11,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:46:11,587 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:46:11,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:11,659 INFO L93 Difference]: Finished difference Result 192 states and 271 transitions. [2025-03-17 05:46:11,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:46:11,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2025-03-17 05:46:11,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:11,661 INFO L225 Difference]: With dead ends: 192 [2025-03-17 05:46:11,661 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 05:46:11,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:46:11,662 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 43 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:11,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 500 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:11,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 05:46:11,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2025-03-17 05:46:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 93 states have internal predecessors, (124), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:46:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 156 transitions. [2025-03-17 05:46:11,677 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 156 transitions. Word has length 110 [2025-03-17 05:46:11,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:11,678 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 156 transitions. [2025-03-17 05:46:11,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:46:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2025-03-17 05:46:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:46:11,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:11,679 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:46:11,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:46:11,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:11,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:11,682 INFO L85 PathProgramCache]: Analyzing trace with hash -398250843, now seen corresponding path program 1 times [2025-03-17 05:46:11,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:11,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768604559] [2025-03-17 05:46:11,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:11,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:11,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:46:11,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:46:11,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:11,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:46:11,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:11,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768604559] [2025-03-17 05:46:11,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768604559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:11,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:11,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:46:11,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562048825] [2025-03-17 05:46:11,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:11,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:46:11,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:11,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:46:11,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:46:11,890 INFO L87 Difference]: Start difference. First operand 111 states and 156 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:46:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:11,912 INFO L93 Difference]: Finished difference Result 192 states and 269 transitions. [2025-03-17 05:46:11,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:46:11,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-17 05:46:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:11,915 INFO L225 Difference]: With dead ends: 192 [2025-03-17 05:46:11,915 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 05:46:11,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:46:11,916 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:11,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 05:46:11,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-17 05:46:11,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 64 states have internal predecessors, (81), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:46:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 113 transitions. [2025-03-17 05:46:11,923 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 113 transitions. Word has length 111 [2025-03-17 05:46:11,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:11,923 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 113 transitions. [2025-03-17 05:46:11,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:46:11,923 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 113 transitions. [2025-03-17 05:46:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:46:11,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:11,924 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:46:11,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:46:11,925 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:11,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:11,925 INFO L85 PathProgramCache]: Analyzing trace with hash 91851354, now seen corresponding path program 1 times [2025-03-17 05:46:11,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:11,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083798100] [2025-03-17 05:46:11,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:11,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:11,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:46:12,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:46:12,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:12,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:46:12,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:46:12,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:46:12,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:46:12,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:12,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:46:12,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:46:12,207 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:46:12,208 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:46:12,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:46:12,211 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 05:46:12,353 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:46:12,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:46:12 BoogieIcfgContainer [2025-03-17 05:46:12,356 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:46:12,356 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:46:12,357 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:46:12,357 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:46:12,357 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:10" (3/4) ... [2025-03-17 05:46:12,359 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:46:12,360 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:46:12,361 INFO L158 Benchmark]: Toolchain (without parser) took 3182.99ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 105.6MB in the beginning and 127.1MB in the end (delta: -21.5MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. [2025-03-17 05:46:12,362 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:46:12,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.37ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 91.6MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:46:12,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.24ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:46:12,362 INFO L158 Benchmark]: Boogie Preprocessor took 71.12ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 84.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:46:12,363 INFO L158 Benchmark]: IcfgBuilder took 540.71ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 50.9MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:46:12,363 INFO L158 Benchmark]: TraceAbstraction took 2285.67ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 49.6MB in the beginning and 128.3MB in the end (delta: -78.6MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. [2025-03-17 05:46:12,363 INFO L158 Benchmark]: Witness Printer took 3.57ms. Allocated memory is still 293.6MB. Free memory was 127.1MB in the beginning and 127.1MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:46:12,364 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.12ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.37ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 91.6MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.24ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.12ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 84.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 540.71ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 50.9MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2285.67ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 49.6MB in the beginning and 128.3MB in the end (delta: -78.6MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. * Witness Printer took 3.57ms. Allocated memory is still 293.6MB. Free memory was 127.1MB in the beginning and 127.1MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L22] signed char var_1_1 = -16; [L23] signed char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_5 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char* var_1_5_Pointer = &(var_1_5); [L26] signed char var_1_6 = -8; [L26] signed char var_1_6 = -8; [L27] signed char* var_1_6_Pointer = &(var_1_6); [L28] signed char var_1_7 = 5; [L28] signed char var_1_7 = 5; [L29] signed char* var_1_7_Pointer = &(var_1_7); [L30] unsigned short int var_1_8 = 2; [L30] unsigned short int var_1_8 = 2; [L31] unsigned short int* var_1_8_Pointer = &(var_1_8); [L32] unsigned char var_1_11 = 0; [L32] unsigned char var_1_11 = 0; [L33] unsigned char* var_1_11_Pointer = &(var_1_11); [L34] double var_1_12 = 8.5; [L34] double var_1_12 = 8.5; [L35] double* var_1_12_Pointer = &(var_1_12); [L36] double var_1_13 = 999999999999.6; [L36] double var_1_13 = 999999999999.6; [L37] double* var_1_13_Pointer = &(var_1_13); [L38] signed long int var_1_14 = 10; [L38] signed long int var_1_14 = 10; [L39] signed long int* var_1_14_Pointer = &(var_1_14); [L40] signed char var_1_15 = -1; [L40] signed char var_1_15 = -1; [L41] signed char* var_1_15_Pointer = &(var_1_15); [L42] unsigned char var_1_16 = 16; [L42] unsigned char var_1_16 = 16; [L43] unsigned char* var_1_16_Pointer = &(var_1_16); [L44] unsigned char var_1_17 = 64; [L44] unsigned char var_1_17 = 64; [L45] unsigned char* var_1_17_Pointer = &(var_1_17); [L46] signed char last_1_var_1_1 = -16; [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR \read(var_1_1) [L104] last_1_var_1_1 = var_1_1 [L114] RET updateLastVariables() [L115] CALL updateVariables() [L81] var_1_5 = __VERIFIER_nondet_uchar() [L82] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L82] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L82] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L83] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L83] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L83] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L84] var_1_6 = __VERIFIER_nondet_char() [L85] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L85] CALL assume_abort_if_not(var_1_6 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L85] RET assume_abort_if_not(var_1_6 >= -31) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L86] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L86] CALL assume_abort_if_not(var_1_6 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L86] RET assume_abort_if_not(var_1_6 <= 31) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L87] var_1_7 = __VERIFIER_nondet_char() [L88] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L88] CALL assume_abort_if_not(var_1_7 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L88] RET assume_abort_if_not(var_1_7 >= -63) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L89] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L89] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L89] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L90] var_1_11 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L91] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L91] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L92] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L92] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L92] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L93] var_1_13 = __VERIFIER_nondet_double() [L94] EXPR \read(var_1_13) [L94] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L94] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F [L94] EXPR \read(var_1_13) [L94] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L94] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L94] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L94] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L94] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L95] var_1_15 = __VERIFIER_nondet_char() [L96] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L96] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L96] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L97] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L97] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L97] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L98] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L98] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L98] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L99] var_1_17 = __VERIFIER_nondet_uchar() [L100] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L100] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L100] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L115] RET updateVariables() [L116] CALL step() [L50] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L50] COND TRUE (*(var_1_5_Pointer)) && (last_1_var_1_1 <= last_1_var_1_1) [L51] EXPR \read(*var_1_17_Pointer) [L51] (*(var_1_16_Pointer)) = (*(var_1_17_Pointer)) [L53] EXPR \read(*var_1_13_Pointer) [L53] (*(var_1_12_Pointer)) = ((*(var_1_13_Pointer)) - 8.3) [L54] EXPR \read(*var_1_13_Pointer) [L54] EXPR \read(*var_1_12_Pointer) [L54] unsigned char stepLocal_1 = (*(var_1_13_Pointer)) >= (*(var_1_12_Pointer)); [L55] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L55] COND TRUE (*(var_1_5_Pointer)) && stepLocal_1 [L56] EXPR \read(*var_1_16_Pointer) [L56] (*(var_1_14_Pointer)) = (*(var_1_16_Pointer)) [L60] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L60] COND TRUE (*(var_1_5_Pointer)) [L61] EXPR \read(*var_1_16_Pointer) [L61] EXPR \read(*var_1_16_Pointer) [L61] (*(var_1_8_Pointer)) = ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))) [L69] EXPR \read(*var_1_8_Pointer) [L69] EXPR \read(*var_1_16_Pointer) [L69] unsigned long int stepLocal_0 = ((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer)); [L70] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L70] COND FALSE !(stepLocal_0 > (*(var_1_8_Pointer))) [L77] EXPR \read(*var_1_6_Pointer) [L77] (*(var_1_1_Pointer)) = (*(var_1_6_Pointer)) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR \read(*var_1_8_Pointer) [L107] EXPR \read(*var_1_16_Pointer) [L107] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR ((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer)))) [L107] EXPR \read(*var_1_1_Pointer) [L107] EXPR \read(*var_1_6_Pointer) [L107] EXPR ((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer)))) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR (((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))))) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR (((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))))) [L107] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR (*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))) [L107] EXPR \read(*var_1_8_Pointer) [L107] EXPR \read(*var_1_16_Pointer) [L107] EXPR \read(*var_1_16_Pointer) [L107] EXPR (*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR (((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))))) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR ((((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))))) && ((*(var_1_12_Pointer)) == ((double) ((*(var_1_13_Pointer)) - 8.3))) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR ((((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))))) && ((*(var_1_12_Pointer)) == ((double) ((*(var_1_13_Pointer)) - 8.3))) [L107] EXPR \read(*var_1_12_Pointer) [L107] EXPR \read(*var_1_13_Pointer) [L107] EXPR ((((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))))) && ((*(var_1_12_Pointer)) == ((double) ((*(var_1_13_Pointer)) - 8.3))) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR (((((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))))) && ((*(var_1_12_Pointer)) == ((double) ((*(var_1_13_Pointer)) - 8.3)))) && (((*(var_1_5_Pointer)) && ((*(var_1_13_Pointer)) >= (*(var_1_12_Pointer)))) ? ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))) : ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_15_Pointer))))) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR (((((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))))) && ((*(var_1_12_Pointer)) == ((double) ((*(var_1_13_Pointer)) - 8.3)))) && (((*(var_1_5_Pointer)) && ((*(var_1_13_Pointer)) >= (*(var_1_12_Pointer)))) ? ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))) : ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_15_Pointer))))) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR ((((((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))))) && ((*(var_1_12_Pointer)) == ((double) ((*(var_1_13_Pointer)) - 8.3)))) && (((*(var_1_5_Pointer)) && ((*(var_1_13_Pointer)) >= (*(var_1_12_Pointer)))) ? ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))) : ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_15_Pointer)))))) && (((*(var_1_5_Pointer)) && (last_1_var_1_1 <= last_1_var_1_1)) ? ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR ((((((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))))) && ((*(var_1_12_Pointer)) == ((double) ((*(var_1_13_Pointer)) - 8.3)))) && (((*(var_1_5_Pointer)) && ((*(var_1_13_Pointer)) >= (*(var_1_12_Pointer)))) ? ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))) : ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_15_Pointer)))))) && (((*(var_1_5_Pointer)) && (last_1_var_1_1 <= last_1_var_1_1)) ? ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107-L108] return ((((((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))))) && ((*(var_1_12_Pointer)) == ((double) ((*(var_1_13_Pointer)) - 8.3)))) && (((*(var_1_5_Pointer)) && ((*(var_1_13_Pointer)) >= (*(var_1_12_Pointer)))) ? ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))) : ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_15_Pointer)))))) && (((*(var_1_5_Pointer)) && (last_1_var_1_1 <= last_1_var_1_1)) ? ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer)))) : 1) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 136 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 1127 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 667 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 460 mSDtfsCounter, 62 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 663 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 546 ConstructedInterpolants, 0 QuantifiedInterpolants, 573 SizeOfPredicates, 0 NumberOfNonLiveVariables, 510 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 1794/1820 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:46:12,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-p_file-41.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 cf57f6cdcf870de2612fde58ee5c1f342ba08bbc54728c19b9bea815b9a3fde0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:46:14,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:46:14,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:46:14,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:46:14,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:46:14,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:46:14,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:46:14,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:46:14,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:46:14,253 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:46:14,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:46:14,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:46:14,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:46:14,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:46:14,254 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:46:14,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:46:14,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:46:14,254 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:46:14,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:46:14,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:46:14,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:46:14,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:46:14,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:46:14,254 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:46:14,254 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:46:14,254 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:46:14,254 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:46:14,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:46:14,255 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:46:14,255 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:46:14,255 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:46:14,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:46:14,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:46:14,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:46:14,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:46:14,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:46:14,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:46:14,255 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:46:14,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:46:14,255 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:46:14,255 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:46:14,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:46:14,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:46:14,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:46:14,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:46:14,255 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 -> cf57f6cdcf870de2612fde58ee5c1f342ba08bbc54728c19b9bea815b9a3fde0 [2025-03-17 05:46:14,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:46:14,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:46:14,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:46:14,464 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:46:14,464 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:46:14,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-41.i [2025-03-17 05:46:15,585 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0f3d9fce/8f53d5c7e9c04406828035adfa39e1e1/FLAG0c15e0d70 [2025-03-17 05:46:15,791 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:46:15,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-41.i [2025-03-17 05:46:15,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0f3d9fce/8f53d5c7e9c04406828035adfa39e1e1/FLAG0c15e0d70 [2025-03-17 05:46:15,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0f3d9fce/8f53d5c7e9c04406828035adfa39e1e1 [2025-03-17 05:46:15,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:46:15,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:46:15,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:46:15,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:46:15,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:46:15,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:46:15" (1/1) ... [2025-03-17 05:46:15,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f1a0c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:15, skipping insertion in model container [2025-03-17 05:46:15,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:46:15" (1/1) ... [2025-03-17 05:46:15,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:46:15,934 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-41.i[916,929] [2025-03-17 05:46:15,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:46:15,997 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:46:16,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-41.i[916,929] [2025-03-17 05:46:16,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:46:16,043 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:46:16,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:16 WrapperNode [2025-03-17 05:46:16,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:46:16,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:46:16,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:46:16,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:46:16,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:16" (1/1) ... [2025-03-17 05:46:16,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:16" (1/1) ... [2025-03-17 05:46:16,089 INFO L138 Inliner]: procedures = 36, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 424 [2025-03-17 05:46:16,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:46:16,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:46:16,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:46:16,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:46:16,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:16" (1/1) ... [2025-03-17 05:46:16,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:16" (1/1) ... [2025-03-17 05:46:16,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:16" (1/1) ... [2025-03-17 05:46:16,118 INFO L175 MemorySlicer]: Split 111 memory accesses to 13 slices as follows [2, 8, 12, 14, 6, 11, 6, 5, 10, 7, 7, 17, 6]. 15 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 3, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1]. [2025-03-17 05:46:16,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:16" (1/1) ... [2025-03-17 05:46:16,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:16" (1/1) ... [2025-03-17 05:46:16,132 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:16" (1/1) ... [2025-03-17 05:46:16,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:16" (1/1) ... [2025-03-17 05:46:16,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:16" (1/1) ... [2025-03-17 05:46:16,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:16" (1/1) ... [2025-03-17 05:46:16,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:46:16,151 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:46:16,151 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:46:16,151 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:46:16,155 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:16" (1/1) ... [2025-03-17 05:46:16,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:46:16,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:16,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:46:16,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:46:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-03-17 05:46:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:46:16,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:46:16,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:46:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:46:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:46:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-17 05:46:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-17 05:46:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-03-17 05:46:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-03-17 05:46:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-03-17 05:46:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-03-17 05:46:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-03-17 05:46:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2025-03-17 05:46:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:46:16,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:46:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:46:16,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:46:16,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-03-17 05:46:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-03-17 05:46:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-03-17 05:46:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2025-03-17 05:46:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:46:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:46:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:46:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:46:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:46:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:46:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-17 05:46:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-17 05:46:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-17 05:46:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-17 05:46:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-03-17 05:46:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-03-17 05:46:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-03-17 05:46:16,362 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:46:16,363 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:46:17,019 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite75#1;havoc property_#t~mem63#1;havoc property_#t~ite72#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~mem71#1;havoc property_#t~mem67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite89#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~short83#1;havoc property_#t~ite88#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~short90#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short97#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short108#1; [2025-03-17 05:46:17,058 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2025-03-17 05:46:17,058 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:46:17,064 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:46:17,065 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:46:17,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:17 BoogieIcfgContainer [2025-03-17 05:46:17,065 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:46:17,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:46:17,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:46:17,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:46:17,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:46:15" (1/3) ... [2025-03-17 05:46:17,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3602d7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:46:17, skipping insertion in model container [2025-03-17 05:46:17,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:16" (2/3) ... [2025-03-17 05:46:17,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3602d7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:46:17, skipping insertion in model container [2025-03-17 05:46:17,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:17" (3/3) ... [2025-03-17 05:46:17,073 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-41.i [2025-03-17 05:46:17,081 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:46:17,082 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-41.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:46:17,118 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:46:17,126 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;@42d1d959, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:46:17,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:46:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 67 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:46:17,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 05:46:17,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:17,135 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:46:17,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:17,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:17,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1637005858, now seen corresponding path program 1 times [2025-03-17 05:46:17,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:17,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691580379] [2025-03-17 05:46:17,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:17,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:17,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:17,151 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:46:17,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:46:17,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 05:46:17,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 05:46:17,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:17,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:17,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:46:17,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-17 05:46:17,554 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:17,555 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:17,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691580379] [2025-03-17 05:46:17,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691580379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:17,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:17,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:46:17,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452127518] [2025-03-17 05:46:17,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:17,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:46:17,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:17,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:46:17,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:46:17,576 INFO L87 Difference]: Start difference. First operand has 83 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 67 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:46:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:17,617 INFO L93 Difference]: Finished difference Result 159 states and 250 transitions. [2025-03-17 05:46:17,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:46:17,618 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2025-03-17 05:46:17,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:17,621 INFO L225 Difference]: With dead ends: 159 [2025-03-17 05:46:17,622 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 05:46:17,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:46:17,625 INFO L435 NwaCegarLoop]: 111 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, 111 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:17,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 05:46:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 05:46:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:46:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2025-03-17 05:46:17,652 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 110 [2025-03-17 05:46:17,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:17,652 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2025-03-17 05:46:17,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:46:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2025-03-17 05:46:17,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 05:46:17,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:17,659 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:46:17,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 05:46:17,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:17,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:17,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash -647212900, now seen corresponding path program 1 times [2025-03-17 05:46:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:17,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192776932] [2025-03-17 05:46:17,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:17,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:17,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:17,868 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:46:17,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:46:18,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 05:46:18,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 05:46:18,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:18,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:18,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:46:18,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:46:18,264 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:18,264 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:18,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192776932] [2025-03-17 05:46:18,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192776932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:18,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:18,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:46:18,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272474936] [2025-03-17 05:46:18,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:18,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:46:18,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:18,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:46:18,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:46:18,266 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:46:18,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:18,425 INFO L93 Difference]: Finished difference Result 156 states and 225 transitions. [2025-03-17 05:46:18,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:46:18,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2025-03-17 05:46:18,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:18,427 INFO L225 Difference]: With dead ends: 156 [2025-03-17 05:46:18,427 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 05:46:18,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 107 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-17 05:46:18,428 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 313 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:18,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 313 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:46:18,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 05:46:18,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2025-03-17 05:46:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:46:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2025-03-17 05:46:18,435 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 110 [2025-03-17 05:46:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:18,436 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2025-03-17 05:46:18,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:46:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2025-03-17 05:46:18,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 05:46:18,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:18,437 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:46:18,446 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-17 05:46:18,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:18,638 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:18,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:18,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1840299933, now seen corresponding path program 1 times [2025-03-17 05:46:18,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:18,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132519488] [2025-03-17 05:46:18,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:18,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:18,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:18,640 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:46:18,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 05:46:18,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 05:46:18,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 05:46:18,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:18,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:18,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:46:18,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:19,456 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 17 treesize of output 13 [2025-03-17 05:46:19,507 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 72 treesize of output 52 [2025-03-17 05:46:19,511 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 42 treesize of output 30 [2025-03-17 05:46:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 16 proven. 162 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-17 05:46:19,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:46:19,673 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:19,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132519488] [2025-03-17 05:46:19,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132519488] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:19,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:19,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2025-03-17 05:46:19,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423182018] [2025-03-17 05:46:19,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:19,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:46:19,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:19,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:46:19,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:46:19,674 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:46:19,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:19,776 INFO L93 Difference]: Finished difference Result 192 states and 271 transitions. [2025-03-17 05:46:19,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:46:19,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2025-03-17 05:46:19,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:19,780 INFO L225 Difference]: With dead ends: 192 [2025-03-17 05:46:19,780 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 05:46:19,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:46:19,781 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 43 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:19,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 500 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:46:19,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 05:46:19,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2025-03-17 05:46:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 93 states have internal predecessors, (124), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:46:19,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 156 transitions. [2025-03-17 05:46:19,793 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 156 transitions. Word has length 110 [2025-03-17 05:46:19,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:19,793 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 156 transitions. [2025-03-17 05:46:19,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:46:19,793 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2025-03-17 05:46:19,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:46:19,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:19,797 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:46:19,804 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-17 05:46:19,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:19,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:19,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:19,998 INFO L85 PathProgramCache]: Analyzing trace with hash -398250843, now seen corresponding path program 1 times [2025-03-17 05:46:19,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:19,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314467071] [2025-03-17 05:46:19,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:19,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-17 05:46:19,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:20,000 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:46:20,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 (5)] Waiting until timeout for monitored process [2025-03-17 05:46:20,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:46:20,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:46:20,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:20,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:20,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 05:46:20,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:46:20,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:20,256 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:20,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314467071] [2025-03-17 05:46:20,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314467071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:20,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:20,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:46:20,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075690937] [2025-03-17 05:46:20,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:20,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:46:20,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:20,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:46:20,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:46:20,258 INFO L87 Difference]: Start difference. First operand 111 states and 156 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:46:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:20,272 INFO L93 Difference]: Finished difference Result 192 states and 269 transitions. [2025-03-17 05:46:20,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:46:20,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-17 05:46:20,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:20,275 INFO L225 Difference]: With dead ends: 192 [2025-03-17 05:46:20,275 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 05:46:20,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 109 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-17 05:46:20,276 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:20,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 05:46:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-17 05:46:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 64 states have internal predecessors, (81), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:46:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 113 transitions. [2025-03-17 05:46:20,285 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 113 transitions. Word has length 111 [2025-03-17 05:46:20,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:20,286 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 113 transitions. [2025-03-17 05:46:20,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:46:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 113 transitions. [2025-03-17 05:46:20,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:46:20,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:20,287 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:46:20,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 05:46:20,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:20,487 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:20,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:20,488 INFO L85 PathProgramCache]: Analyzing trace with hash 91851354, now seen corresponding path program 1 times [2025-03-17 05:46:20,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:20,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056613631] [2025-03-17 05:46:20,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:20,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:20,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:20,491 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:46:20,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 05:46:20,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:46:20,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:46:20,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:20,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:20,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:46:20,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:20,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:46:20,906 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 155 treesize of output 65 [2025-03-17 05:46:20,923 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-17 05:46:20,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:20,923 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:20,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056613631] [2025-03-17 05:46:20,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056613631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:20,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:20,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:46:20,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134727175] [2025-03-17 05:46:20,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:20,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:46:20,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:20,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:46:20,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:46:20,925 INFO L87 Difference]: Start difference. First operand 82 states and 113 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:46:21,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:21,360 INFO L93 Difference]: Finished difference Result 160 states and 220 transitions. [2025-03-17 05:46:21,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:46:21,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2025-03-17 05:46:21,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:21,364 INFO L225 Difference]: With dead ends: 160 [2025-03-17 05:46:21,364 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 05:46:21,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 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-17 05:46:21,365 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 74 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:21,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 340 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:46:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 05:46:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-03-17 05:46:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 64 states have internal predecessors, (80), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:46:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 112 transitions. [2025-03-17 05:46:21,380 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 112 transitions. Word has length 112 [2025-03-17 05:46:21,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:21,381 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 112 transitions. [2025-03-17 05:46:21,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:46:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 112 transitions. [2025-03-17 05:46:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:46:21,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:21,381 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:46:21,395 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 (6)] Forceful destruction successful, exit code 0 [2025-03-17 05:46:21,582 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-17 05:46:21,582 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:21,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:21,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1396038436, now seen corresponding path program 1 times [2025-03-17 05:46:21,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:21,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272014937] [2025-03-17 05:46:21,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:21,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:21,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:21,585 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-17 05:46:21,587 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-17 05:46:21,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:46:34,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:46:34,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:34,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:34,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 05:46:34,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:36,406 INFO L224 Elim1Store]: Index analysis took 105 ms [2025-03-17 05:46:36,576 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 18 treesize of output 19 [2025-03-17 05:46:49,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:46:49,711 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 210 treesize of output 140 [2025-03-17 05:46:49,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:46:49,737 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 298 treesize of output 148 [2025-03-17 05:46:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 5 proven. 207 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-03-17 05:46:51,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:47:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:47:02,245 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:02,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272014937] [2025-03-17 05:47:02,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272014937] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:47:02,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:47:02,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2025-03-17 05:47:02,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404753805] [2025-03-17 05:47:02,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:02,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:47:02,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:02,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:47:02,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:47:02,246 INFO L87 Difference]: Start difference. First operand 82 states and 112 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:47:09,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:09,890 INFO L93 Difference]: Finished difference Result 218 states and 295 transitions. [2025-03-17 05:47:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:47:09,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-03-17 05:47:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:09,900 INFO L225 Difference]: With dead ends: 218 [2025-03-17 05:47:09,900 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 05:47:09,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:47:09,901 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 62 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:09,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 545 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-17 05:47:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 05:47:09,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2025-03-17 05:47:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 109 states have (on average 1.275229357798165) internal successors, (139), 111 states have internal predecessors, (139), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:47:09,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 187 transitions. [2025-03-17 05:47:09,909 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 187 transitions. Word has length 114 [2025-03-17 05:47:09,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:09,910 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 187 transitions. [2025-03-17 05:47:09,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:47:09,910 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 187 transitions. [2025-03-17 05:47:09,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:47:09,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:09,912 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:47:09,928 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-17 05:47:10,112 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-17 05:47:10,113 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:10,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:10,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1091474397, now seen corresponding path program 1 times [2025-03-17 05:47:10,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:47:10,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834359913] [2025-03-17 05:47:10,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:10,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:10,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:47:10,116 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-17 05:47:10,117 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-17 05:47:10,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:47:10,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:47:10,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:10,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:10,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:47:10,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:10,381 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 21 treesize of output 17 [2025-03-17 05:47:10,412 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 66 treesize of output 54 [2025-03-17 05:47:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:47:10,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:47:10,436 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:10,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834359913] [2025-03-17 05:47:10,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834359913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:47:10,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:47:10,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:47:10,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169743633] [2025-03-17 05:47:10,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:10,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:47:10,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:10,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:47:10,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:47:10,438 INFO L87 Difference]: Start difference. First operand 138 states and 187 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:47:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:10,708 INFO L93 Difference]: Finished difference Result 410 states and 555 transitions. [2025-03-17 05:47:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:47:10,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-03-17 05:47:10,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:10,710 INFO L225 Difference]: With dead ends: 410 [2025-03-17 05:47:10,710 INFO L226 Difference]: Without dead ends: 277 [2025-03-17 05:47:10,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:47:10,712 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 95 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:10,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 684 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:47:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-17 05:47:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 263. [2025-03-17 05:47:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 208 states have (on average 1.25) internal successors, (260), 212 states have internal predecessors, (260), 46 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (46), 42 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-17 05:47:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 352 transitions. [2025-03-17 05:47:10,746 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 352 transitions. Word has length 114 [2025-03-17 05:47:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:10,747 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 352 transitions. [2025-03-17 05:47:10,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:47:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 352 transitions. [2025-03-17 05:47:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:47:10,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:10,748 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:47:10,757 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 (8)] Forceful destruction successful, exit code 0 [2025-03-17 05:47:10,948 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-17 05:47:10,949 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:10,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:10,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1184687523, now seen corresponding path program 1 times [2025-03-17 05:47:10,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:47:10,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797858024] [2025-03-17 05:47:10,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:10,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:10,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:47:10,951 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-17 05:47:10,952 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-17 05:47:11,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:47:11,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:47:11,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:11,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:11,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 05:47:11,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:14,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:47:14,312 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 291 treesize of output 141 [2025-03-17 05:47:16,712 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 27 treesize of output 15 [2025-03-17 05:47:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 11 proven. 253 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-17 05:47:16,818 INFO L312 TraceCheckSpWp]: Computing backward predicates...