./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-65.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-65.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 187e608dd7eb0d2f9c48e42a2102391c335d64a7aaf23ffbd5cb60332049f233 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:49:05,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:49:05,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:49:05,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:49:05,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:49:05,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:49:05,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:49:05,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:49:05,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:49:05,393 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:49:05,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:49:05,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:49:05,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:49:05,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:49:05,393 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:49:05,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:49:05,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:49:05,394 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:49:05,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:49:05,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:49:05,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:49:05,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:49:05,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:49:05,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:49:05,394 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:49:05,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:49:05,394 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:49:05,394 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:49:05,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:49:05,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:49:05,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:49:05,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:49:05,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:49:05,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:49:05,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:49:05,395 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:49:05,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:49:05,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:49:05,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:49:05,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:49:05,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:49:05,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:49:05,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:49:05,395 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 -> 187e608dd7eb0d2f9c48e42a2102391c335d64a7aaf23ffbd5cb60332049f233 [2025-03-17 05:49:05,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:49:05,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:49:05,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:49:05,643 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:49:05,643 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:49:05,644 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-65.i [2025-03-17 05:49:06,777 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa6d50983/7c8ed2f14e5f4022b07b0e4023ec19c2/FLAG1f8f4b210 [2025-03-17 05:49:07,071 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:49:07,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-65.i [2025-03-17 05:49:07,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa6d50983/7c8ed2f14e5f4022b07b0e4023ec19c2/FLAG1f8f4b210 [2025-03-17 05:49:07,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa6d50983/7c8ed2f14e5f4022b07b0e4023ec19c2 [2025-03-17 05:49:07,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:49:07,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:49:07,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:49:07,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:49:07,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:49:07,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:49:07" (1/1) ... [2025-03-17 05:49:07,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb92a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:07, skipping insertion in model container [2025-03-17 05:49:07,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:49:07" (1/1) ... [2025-03-17 05:49:07,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:49:07,507 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-65.i[916,929] [2025-03-17 05:49:07,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:49:07,566 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:49:07,574 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-65.i[916,929] [2025-03-17 05:49:07,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:49:07,624 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:49:07,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:07 WrapperNode [2025-03-17 05:49:07,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:49:07,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:49:07,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:49:07,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:49:07,631 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:49:07" (1/1) ... [2025-03-17 05:49:07,643 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:49:07" (1/1) ... [2025-03-17 05:49:07,663 INFO L138 Inliner]: procedures = 29, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 517 [2025-03-17 05:49:07,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:49:07,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:49:07,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:49:07,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:49:07,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:07" (1/1) ... [2025-03-17 05:49:07,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:07" (1/1) ... [2025-03-17 05:49:07,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:07" (1/1) ... [2025-03-17 05:49:07,686 INFO L175 MemorySlicer]: Split 123 memory accesses to 15 slices as follows [2, 9, 8, 20, 3, 8, 10, 10, 8, 8, 3, 6, 7, 8, 13]. 16 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-03-17 05:49:07,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:07" (1/1) ... [2025-03-17 05:49:07,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:07" (1/1) ... [2025-03-17 05:49:07,697 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:07" (1/1) ... [2025-03-17 05:49:07,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:07" (1/1) ... [2025-03-17 05:49:07,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:07" (1/1) ... [2025-03-17 05:49:07,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:07" (1/1) ... [2025-03-17 05:49:07,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:49:07,706 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:49:07,706 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:49:07,706 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:49:07,707 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:07" (1/1) ... [2025-03-17 05:49:07,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:49:07,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:49:07,728 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:49:07,729 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:49:07,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:49:07,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:49:07,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:49:07,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:49:07,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:49:07,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:49:07,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:49:07,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:49:07,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:49:07,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:49:07,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:49:07,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:49:07,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 05:49:07,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 05:49:07,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-17 05:49:07,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-17 05:49:07,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:49:07,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:49:07,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:49:07,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:49:07,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:49:07,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:49:07,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:49:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-17 05:49:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-17 05:49:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-17 05:49:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-17 05:49:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-03-17 05:49:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-03-17 05:49:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-03-17 05:49:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-03-17 05:49:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:49:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:49:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:49:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:49:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:49:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:49:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:49:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-17 05:49:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-17 05:49:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-17 05:49:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-17 05:49:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-03-17 05:49:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-03-17 05:49:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-03-17 05:49:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-03-17 05:49:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:49:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:49:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:49:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:49:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:49:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:49:07,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:49:07,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:49:07,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:49:07,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:49:07,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:49:07,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 05:49:07,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 05:49:07,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-17 05:49:07,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-17 05:49:07,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:49:07,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:49:07,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:49:07,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:49:07,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:49:07,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:49:07,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:49:07,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-17 05:49:07,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-17 05:49:07,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-17 05:49:07,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-17 05:49:07,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-03-17 05:49:07,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-03-17 05:49:07,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-03-17 05:49:07,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-03-17 05:49:07,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:49:07,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:49:07,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:49:07,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:49:07,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:49:07,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:49:07,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:49:07,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:49:07,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:49:07,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:49:07,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:49:07,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:49:07,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:49:07,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 05:49:07,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 05:49:07,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-17 05:49:07,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-17 05:49:07,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:49:07,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:49:07,918 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:49:07,921 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:49:08,307 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~ite98#1;havoc property_#t~mem86#1;havoc property_#t~ite92#1;havoc property_#t~mem91#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem97#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~ite103#1;havoc property_#t~mem102#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~ite126#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem117#1;havoc property_#t~mem113#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem116#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1; [2025-03-17 05:49:08,367 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2025-03-17 05:49:08,367 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:49:08,378 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:49:08,380 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:49:08,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:49:08 BoogieIcfgContainer [2025-03-17 05:49:08,380 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:49:08,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:49:08,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:49:08,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:49:08,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:49:07" (1/3) ... [2025-03-17 05:49:08,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cdac34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:49:08, skipping insertion in model container [2025-03-17 05:49:08,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:07" (2/3) ... [2025-03-17 05:49:08,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cdac34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:49:08, skipping insertion in model container [2025-03-17 05:49:08,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:49:08" (3/3) ... [2025-03-17 05:49:08,388 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-65.i [2025-03-17 05:49:08,398 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:49:08,401 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-65.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:49:08,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:49:08,457 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;@3070a1dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:49:08,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:49:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 93 states have (on average 1.4731182795698925) internal successors, (137), 94 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:49:08,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:49:08,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:08,468 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:08,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:08,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:08,472 INFO L85 PathProgramCache]: Analyzing trace with hash 757387111, now seen corresponding path program 1 times [2025-03-17 05:49:08,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:08,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287664447] [2025-03-17 05:49:08,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:08,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:08,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:49:08,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:49:08,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:08,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 05:49:08,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:08,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287664447] [2025-03-17 05:49:08,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287664447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:49:08,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190209855] [2025-03-17 05:49:08,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:08,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:49:08,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:49:08,752 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:49:08,753 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:49:08,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:49:08,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:49:08,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:08,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:08,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:49:08,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 05:49:09,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:09,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190209855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:09,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:49:09,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:49:09,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969019064] [2025-03-17 05:49:09,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:09,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:49:09,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:09,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:49:09,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:49:09,021 INFO L87 Difference]: Start difference. First operand has 107 states, 93 states have (on average 1.4731182795698925) internal successors, (137), 94 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:49:09,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:09,040 INFO L93 Difference]: Finished difference Result 211 states and 327 transitions. [2025-03-17 05:49:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:49:09,041 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-17 05:49:09,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:09,046 INFO L225 Difference]: With dead ends: 211 [2025-03-17 05:49:09,046 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 05:49:09,048 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:49:09,050 INFO L435 NwaCegarLoop]: 153 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, 153 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:49:09,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:09,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 05:49:09,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-17 05:49:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:49:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2025-03-17 05:49:09,080 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 108 [2025-03-17 05:49:09,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:09,080 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2025-03-17 05:49:09,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:49:09,081 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2025-03-17 05:49:09,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:49:09,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:09,083 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:09,091 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:49:09,284 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:49:09,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:09,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:09,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2073987370, now seen corresponding path program 1 times [2025-03-17 05:49:09,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:09,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332822079] [2025-03-17 05:49:09,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:09,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:09,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:49:09,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:49:09,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:09,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:49:09,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:09,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332822079] [2025-03-17 05:49:09,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332822079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:09,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:09,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:49:09,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366851148] [2025-03-17 05:49:09,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:09,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:49:09,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:09,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:49:09,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:49:09,533 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:49:09,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:09,570 INFO L93 Difference]: Finished difference Result 211 states and 308 transitions. [2025-03-17 05:49:09,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:49:09,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-17 05:49:09,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:09,573 INFO L225 Difference]: With dead ends: 211 [2025-03-17 05:49:09,574 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 05:49:09,574 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:49:09,574 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:09,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 05:49:09,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-17 05:49:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:49:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2025-03-17 05:49:09,582 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 108 [2025-03-17 05:49:09,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:09,582 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2025-03-17 05:49:09,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:49:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2025-03-17 05:49:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:49:09,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:09,585 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:09,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:49:09,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:09,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1612903063, now seen corresponding path program 1 times [2025-03-17 05:49:09,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:09,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631898642] [2025-03-17 05:49:09,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:09,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:09,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:49:09,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:49:09,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:09,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:49:09,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:09,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631898642] [2025-03-17 05:49:09,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631898642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:49:09,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942379656] [2025-03-17 05:49:09,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:09,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:49:09,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:49:09,828 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:49:09,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:49:09,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:49:10,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:49:10,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:10,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:10,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:49:10,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:10,085 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:49:10,087 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:10,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942379656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:10,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:49:10,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-17 05:49:10,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034600665] [2025-03-17 05:49:10,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:10,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:49:10,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:10,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:49:10,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:49:10,088 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:10,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:10,118 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2025-03-17 05:49:10,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:49:10,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-17 05:49:10,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:10,120 INFO L225 Difference]: With dead ends: 216 [2025-03-17 05:49:10,124 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 05:49:10,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:49:10,125 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 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:49:10,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 05:49:10,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-17 05:49:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:49:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-17 05:49:10,136 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 108 [2025-03-17 05:49:10,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:10,136 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-17 05:49:10,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:10,136 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-17 05:49:10,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:49:10,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:10,137 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:10,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:49:10,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-17 05:49:10,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:10,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:10,339 INFO L85 PathProgramCache]: Analyzing trace with hash 874609770, now seen corresponding path program 1 times [2025-03-17 05:49:10,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:10,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093034362] [2025-03-17 05:49:10,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:10,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:10,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:49:10,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:49:10,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:10,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:49:10,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:10,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093034362] [2025-03-17 05:49:10,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093034362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:49:10,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372256974] [2025-03-17 05:49:10,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:10,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:49:10,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:49:10,549 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:49:10,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:49:10,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:49:10,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:49:10,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:10,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:10,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:49:10,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:10,778 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:49:10,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:10,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372256974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:10,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:49:10,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-17 05:49:10,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210663929] [2025-03-17 05:49:10,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:10,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:49:10,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:10,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:49:10,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:49:10,781 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:10,805 INFO L93 Difference]: Finished difference Result 220 states and 317 transitions. [2025-03-17 05:49:10,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:49:10,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-17 05:49:10,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:10,807 INFO L225 Difference]: With dead ends: 220 [2025-03-17 05:49:10,807 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 05:49:10,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:49:10,808 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:10,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 05:49:10,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-03-17 05:49:10,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:49:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-03-17 05:49:10,820 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 108 [2025-03-17 05:49:10,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:10,820 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-03-17 05:49:10,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:10,820 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-03-17 05:49:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:49:10,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:10,821 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:10,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:49:11,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:49:11,026 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:11,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:11,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1762113451, now seen corresponding path program 1 times [2025-03-17 05:49:11,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:11,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948711819] [2025-03-17 05:49:11,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:11,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:11,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:49:11,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:49:11,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:11,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:11,201 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:49:11,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:11,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948711819] [2025-03-17 05:49:11,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948711819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:49:11,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814924790] [2025-03-17 05:49:11,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:11,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:49:11,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:49:11,204 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:49:11,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:49:11,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:49:11,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:49:11,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:11,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:11,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:49:11,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:49:11,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:11,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814924790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:11,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:49:11,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-17 05:49:11,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821770984] [2025-03-17 05:49:11,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:11,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:49:11,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:11,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:49:11,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:49:11,425 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:11,442 INFO L93 Difference]: Finished difference Result 224 states and 321 transitions. [2025-03-17 05:49:11,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:49:11,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-17 05:49:11,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:11,444 INFO L225 Difference]: With dead ends: 224 [2025-03-17 05:49:11,444 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 05:49:11,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:49:11,449 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:11,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 05:49:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-17 05:49:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:49:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-03-17 05:49:11,459 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 108 [2025-03-17 05:49:11,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:11,459 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-03-17 05:49:11,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-03-17 05:49:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:49:11,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:11,464 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:11,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:49:11,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:49:11,665 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:11,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:11,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1763036972, now seen corresponding path program 1 times [2025-03-17 05:49:11,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:11,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167406220] [2025-03-17 05:49:11,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:11,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:11,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:49:11,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:49:11,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:11,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:49:11,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:11,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167406220] [2025-03-17 05:49:11,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167406220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:49:11,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612414600] [2025-03-17 05:49:11,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:11,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:49:11,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:49:11,810 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:49:11,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:49:11,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:49:11,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:49:11,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:11,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:11,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:49:12,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:12,039 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:49:12,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:12,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612414600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:12,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:49:12,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 05:49:12,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822623609] [2025-03-17 05:49:12,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:12,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:12,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:12,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:12,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:49:12,041 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:12,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:12,066 INFO L93 Difference]: Finished difference Result 228 states and 325 transitions. [2025-03-17 05:49:12,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:49:12,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-17 05:49:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:12,068 INFO L225 Difference]: With dead ends: 228 [2025-03-17 05:49:12,068 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 05:49:12,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:49:12,069 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:12,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 585 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:12,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 05:49:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-17 05:49:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 103 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:49:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2025-03-17 05:49:12,077 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 108 [2025-03-17 05:49:12,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:12,078 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2025-03-17 05:49:12,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2025-03-17 05:49:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:49:12,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:12,079 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:12,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 05:49:12,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:49:12,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:12,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:12,280 INFO L85 PathProgramCache]: Analyzing trace with hash -982333292, now seen corresponding path program 1 times [2025-03-17 05:49:12,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:12,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493820630] [2025-03-17 05:49:12,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:12,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:12,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:49:12,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:49:12,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:12,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:12,517 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:49:12,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:12,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493820630] [2025-03-17 05:49:12,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493820630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:12,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:12,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:49:12,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960096870] [2025-03-17 05:49:12,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:12,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:12,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:12,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:12,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:12,520 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:12,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:12,568 INFO L93 Difference]: Finished difference Result 284 states and 397 transitions. [2025-03-17 05:49:12,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:49:12,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-17 05:49:12,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:12,569 INFO L225 Difference]: With dead ends: 284 [2025-03-17 05:49:12,569 INFO L226 Difference]: Without dead ends: 169 [2025-03-17 05:49:12,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:12,570 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 59 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:12,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 576 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:12,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-17 05:49:12,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 118. [2025-03-17 05:49:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 105 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:49:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2025-03-17 05:49:12,576 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 108 [2025-03-17 05:49:12,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:12,576 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2025-03-17 05:49:12,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2025-03-17 05:49:12,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:49:12,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:12,577 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:12,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:49:12,577 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:12,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:12,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1916134259, now seen corresponding path program 1 times [2025-03-17 05:49:12,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:12,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285022730] [2025-03-17 05:49:12,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:12,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:12,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:49:12,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:49:12,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:12,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:49:12,622 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:49:12,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:49:12,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:49:12,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:12,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:49:12,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:49:12,729 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:49:12,730 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:49:12,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:49:12,734 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:12,883 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:49:12,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:49:12 BoogieIcfgContainer [2025-03-17 05:49:12,887 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:49:12,887 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:49:12,888 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:49:12,888 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:49:12,888 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:49:08" (3/4) ... [2025-03-17 05:49:12,890 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:49:12,891 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:49:12,892 INFO L158 Benchmark]: Toolchain (without parser) took 5521.13ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 113.3MB in the beginning and 102.3MB in the end (delta: 11.0MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2025-03-17 05:49:12,892 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:49:12,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.78ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 99.6MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:49:12,893 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.35ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 96.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:49:12,893 INFO L158 Benchmark]: Boogie Preprocessor took 41.25ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 91.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:49:12,894 INFO L158 Benchmark]: IcfgBuilder took 673.86ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 54.3MB in the end (delta: 37.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:49:12,894 INFO L158 Benchmark]: TraceAbstraction took 4504.22ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 53.8MB in the beginning and 104.3MB in the end (delta: -50.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:49:12,894 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 184.5MB. Free memory was 104.3MB in the beginning and 102.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:49:12,895 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.78ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 99.6MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.35ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 96.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.25ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 91.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 673.86ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 54.3MB in the end (delta: 37.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4504.22ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 53.8MB in the beginning and 104.3MB in the end (delta: -50.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 184.5MB. Free memory was 104.3MB in the beginning and 102.3MB in the end (delta: 2.0MB). 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 70, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someUnaryFLOAToperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 1000000000.1; [L22] float var_1_1 = 1000000000.1; [L23] float* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_3 = 1; [L24] unsigned char var_1_3 = 1; [L25] unsigned char* var_1_3_Pointer = &(var_1_3); [L26] float var_1_4 = 8.2; [L26] float var_1_4 = 8.2; [L27] float* var_1_4_Pointer = &(var_1_4); [L28] signed long int var_1_5 = -32; [L28] signed long int var_1_5 = -32; [L29] signed long int* var_1_5_Pointer = &(var_1_5); [L30] double var_1_9 = 100.5; [L30] double var_1_9 = 100.5; [L31] double* var_1_9_Pointer = &(var_1_9); [L32] double var_1_12 = 25.25; [L32] double var_1_12 = 25.25; [L33] double* var_1_12_Pointer = &(var_1_12); [L34] double var_1_13 = 63.6; [L34] double var_1_13 = 63.6; [L35] double* var_1_13_Pointer = &(var_1_13); [L36] double var_1_14 = 0.0; [L36] double var_1_14 = 0.0; [L37] double* var_1_14_Pointer = &(var_1_14); [L38] double var_1_15 = 0.8; [L38] double var_1_15 = 0.8; [L39] double* var_1_15_Pointer = &(var_1_15); [L40] signed char var_1_16 = -8; [L40] signed char var_1_16 = -8; [L41] signed char* var_1_16_Pointer = &(var_1_16); [L42] signed char var_1_17 = 8; [L42] signed char var_1_17 = 8; [L43] signed char* var_1_17_Pointer = &(var_1_17); [L44] unsigned short int var_1_18 = 2; [L44] unsigned short int var_1_18 = 2; [L45] unsigned short int* var_1_18_Pointer = &(var_1_18); [L46] unsigned short int var_1_19 = 50; [L46] unsigned short int var_1_19 = 50; [L47] unsigned short int* var_1_19_Pointer = &(var_1_19); [L48] unsigned short int var_1_20 = 0; [L48] unsigned short int var_1_20 = 0; [L49] unsigned short int* var_1_20_Pointer = &(var_1_20); [L50] double last_1_var_1_9 = 100.5; [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] CALL updateLastVariables() [L99] EXPR \read(var_1_9) [L99] last_1_var_1_9 = var_1_9 [L109] RET updateLastVariables() [L110] CALL updateVariables() [L78] var_1_3 = __VERIFIER_nondet_uchar() [L79] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L80] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L80] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L80] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] var_1_4 = __VERIFIER_nondet_float() [L82] EXPR \read(var_1_4) [L82] EXPR var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] EXPR var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F [L82] EXPR \read(var_1_4) [L82] EXPR var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] EXPR (var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] EXPR (var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] var_1_12 = __VERIFIER_nondet_double() [L84] EXPR \read(var_1_12) [L84] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F [L84] EXPR \read(var_1_12) [L84] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L85] var_1_13 = __VERIFIER_nondet_double() [L86] EXPR \read(var_1_13) [L86] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F [L86] EXPR \read(var_1_13) [L86] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] 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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] 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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] 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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] 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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L87] var_1_14 = __VERIFIER_nondet_double() [L88] EXPR \read(var_1_14) [L88] EXPR var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] EXPR var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F [L88] EXPR \read(var_1_14) [L88] EXPR var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] EXPR (var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] EXPR (var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] CALL assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] RET assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] var_1_15 = __VERIFIER_nondet_double() [L90] EXPR \read(var_1_15) [L90] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F [L90] EXPR \read(var_1_15) [L90] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L91] var_1_17 = __VERIFIER_nondet_char() [L92] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] var_1_19 = __VERIFIER_nondet_ushort() [L95] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L95] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L95] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L110] RET updateVariables() [L111] CALL step() [L54] COND TRUE 0.625f > last_1_var_1_9 [L55] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L55] COND FALSE !((*(var_1_3_Pointer))) [L61] EXPR \read(*var_1_17_Pointer) [L61] (*(var_1_16_Pointer)) = (*(var_1_17_Pointer)) [L62] EXPR \read(*var_1_19_Pointer) [L62] (*(var_1_18_Pointer)) = (*(var_1_19_Pointer)) [L63] EXPR \read(*var_1_19_Pointer) [L63] (*(var_1_20_Pointer)) = (*(var_1_19_Pointer)) [L64] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L64] COND FALSE !((*(var_1_3_Pointer))) [L69] EXPR \read(*var_1_1_Pointer) [L69] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L69] COND TRUE (*(var_1_1_Pointer)) <= (*(var_1_1_Pointer)) [L70] EXPR \read(*var_1_13_Pointer) [L70] EXPR \read(*var_1_14_Pointer) [L70] EXPR \read(*var_1_15_Pointer) [L70] (*(var_1_9_Pointer)) = ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))) [L73] EXPR \read(*var_1_4_Pointer) [L73] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L73] COND FALSE !((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR (0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) [L102] EXPR \read(*var_1_1_Pointer) [L102] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))) [L102] EXPR \read(*var_1_4_Pointer) [L102] EXPR (((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1)) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1)) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102-L103] return ((((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 170 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 3077 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2026 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 130 IncrementalHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1051 mSDtfsCounter, 130 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 579 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=7, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 54 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1404 NumberOfCodeBlocks, 1404 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1284 ConstructedInterpolants, 0 QuantifiedInterpolants, 1370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2608 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 2500/2640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:49:12,913 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-65.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 187e608dd7eb0d2f9c48e42a2102391c335d64a7aaf23ffbd5cb60332049f233 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:49:14,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:49:14,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:49:14,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:49:14,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:49:14,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:49:14,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:49:14,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:49:14,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:49:14,956 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:49:14,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:49:14,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:49:14,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:49:14,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:49:14,956 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:49:14,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:49:14,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:49:14,956 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:49:14,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:49:14,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:49:14,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:49:14,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:49:14,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:49:14,959 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:49:14,959 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:49:14,959 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:49:14,959 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:49:14,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:49:14,959 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:49:14,960 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:49:14,960 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:49:14,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:49:14,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:49:14,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:49:14,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:49:14,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:49:14,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:49:14,961 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:49:14,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:49:14,961 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:49:14,961 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:49:14,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:49:14,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:49:14,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:49:14,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:49:14,962 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 -> 187e608dd7eb0d2f9c48e42a2102391c335d64a7aaf23ffbd5cb60332049f233 [2025-03-17 05:49:15,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:49:15,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:49:15,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:49:15,203 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:49:15,203 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:49:15,204 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-65.i [2025-03-17 05:49:16,333 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/651e6b003/c7fb1f167d844650b46971635a01f639/FLAGf5a9273cd [2025-03-17 05:49:16,544 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:49:16,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-65.i [2025-03-17 05:49:16,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/651e6b003/c7fb1f167d844650b46971635a01f639/FLAGf5a9273cd [2025-03-17 05:49:16,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/651e6b003/c7fb1f167d844650b46971635a01f639 [2025-03-17 05:49:16,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:49:16,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:49:16,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:49:16,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:49:16,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:49:16,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:49:16" (1/1) ... [2025-03-17 05:49:16,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b88d5d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:16, skipping insertion in model container [2025-03-17 05:49:16,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:49:16" (1/1) ... [2025-03-17 05:49:16,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:49:17,005 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-65.i[916,929] [2025-03-17 05:49:17,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:49:17,057 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:49:17,065 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-65.i[916,929] [2025-03-17 05:49:17,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:49:17,108 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:49:17,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17 WrapperNode [2025-03-17 05:49:17,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:49:17,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:49:17,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:49:17,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:49:17,115 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:49:17" (1/1) ... [2025-03-17 05:49:17,125 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:49:17" (1/1) ... [2025-03-17 05:49:17,157 INFO L138 Inliner]: procedures = 39, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 516 [2025-03-17 05:49:17,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:49:17,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:49:17,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:49:17,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:49:17,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:17,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:17,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:17,192 INFO L175 MemorySlicer]: Split 123 memory accesses to 15 slices as follows [2, 9, 8, 20, 3, 8, 10, 10, 8, 8, 3, 6, 7, 8, 13]. 16 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-03-17 05:49:17,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:17,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:17,232 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:17,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:17,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:17,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:17,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:49:17,257 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:49:17,257 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:49:17,257 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:49:17,258 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:17,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:49:17,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:49:17,289 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:49:17,292 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:49:17,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:49:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:49:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:49:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:49:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:49:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:49:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-17 05:49:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-17 05:49:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-03-17 05:49:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-03-17 05:49:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-03-17 05:49:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2025-03-17 05:49:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2025-03-17 05:49:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2025-03-17 05:49:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2025-03-17 05:49:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2025-03-17 05:49:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:49:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:49:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:49:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:49:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:49:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-17 05:49:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-17 05:49:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-03-17 05:49:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-03-17 05:49:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-03-17 05:49:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2025-03-17 05:49:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2025-03-17 05:49:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2025-03-17 05:49:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2025-03-17 05:49:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2025-03-17 05:49:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:49:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:49:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:49:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:49:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:49:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:49:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:49:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-17 05:49:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-17 05:49:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-17 05:49:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-17 05:49:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-17 05:49:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-03-17 05:49:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-03-17 05:49:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-03-17 05:49:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:49:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:49:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:49:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:49:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:49:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-17 05:49:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-17 05:49:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-17 05:49:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-03-17 05:49:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-03-17 05:49:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-03-17 05:49:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-03-17 05:49:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-03-17 05:49:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-03-17 05:49:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2025-03-17 05:49:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:49:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:49:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:49:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:49:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:49:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:49:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:49:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-17 05:49:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-17 05:49:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-17 05:49:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-17 05:49:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-17 05:49:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-03-17 05:49:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-03-17 05:49:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-03-17 05:49:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:49:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:49:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:49:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:49:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:49:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:49:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-17 05:49:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-17 05:49:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-17 05:49:17,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-17 05:49:17,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-17 05:49:17,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-03-17 05:49:17,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-03-17 05:49:17,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-03-17 05:49:17,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2025-03-17 05:49:17,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:49:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:49:17,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:49:17,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:49:17,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:49:17,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:49:17,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-17 05:49:17,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-17 05:49:17,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-03-17 05:49:17,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-03-17 05:49:17,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-03-17 05:49:17,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-03-17 05:49:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-03-17 05:49:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-03-17 05:49:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2025-03-17 05:49:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:49:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:49:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:49:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:49:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:49:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:49:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-17 05:49:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-17 05:49:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-03-17 05:49:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-03-17 05:49:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-03-17 05:49:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-03-17 05:49:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-03-17 05:49:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-03-17 05:49:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2025-03-17 05:49:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:49:17,325 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:49:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:49:17,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:49:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:49:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:49:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:49:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:49:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:49:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:49:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:49:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-17 05:49:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-17 05:49:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-17 05:49:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-17 05:49:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-17 05:49:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-03-17 05:49:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-03-17 05:49:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-03-17 05:49:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:49:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:49:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:49:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:49:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:49:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-17 05:49:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-17 05:49:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-03-17 05:49:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-03-17 05:49:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-03-17 05:49:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-03-17 05:49:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-03-17 05:49:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2025-03-17 05:49:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2025-03-17 05:49:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2025-03-17 05:49:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:49:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:49:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:49:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:49:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:49:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:49:17,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-17 05:49:17,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-17 05:49:17,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-17 05:49:17,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-17 05:49:17,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-03-17 05:49:17,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-03-17 05:49:17,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-03-17 05:49:17,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-03-17 05:49:17,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2025-03-17 05:49:17,572 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:49:17,574 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:49:20,907 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~ite98#1;havoc property_#t~mem86#1;havoc property_#t~ite92#1;havoc property_#t~mem91#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem97#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~ite103#1;havoc property_#t~mem102#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~ite126#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem117#1;havoc property_#t~mem113#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem116#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1; [2025-03-17 05:49:20,941 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2025-03-17 05:49:20,942 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:49:20,949 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:49:20,949 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:49:20,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:49:20 BoogieIcfgContainer [2025-03-17 05:49:20,949 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:49:20,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:49:20,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:49:20,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:49:20,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:49:16" (1/3) ... [2025-03-17 05:49:20,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776c2c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:49:20, skipping insertion in model container [2025-03-17 05:49:20,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (2/3) ... [2025-03-17 05:49:20,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776c2c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:49:20, skipping insertion in model container [2025-03-17 05:49:20,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:49:20" (3/3) ... [2025-03-17 05:49:20,956 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-65.i [2025-03-17 05:49:20,965 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:49:20,966 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-65.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:49:21,001 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:49:21,009 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;@1c0418ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:49:21,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:49:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 93 states have (on average 1.4731182795698925) internal successors, (137), 94 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:49:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:49:21,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:21,018 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:21,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:21,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:21,022 INFO L85 PathProgramCache]: Analyzing trace with hash 757387111, now seen corresponding path program 1 times [2025-03-17 05:49:21,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:21,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086289342] [2025-03-17 05:49:21,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:21,030 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:49:21,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:21,033 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:49:21,034 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:49:21,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:49:21,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:49:21,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:21,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:21,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:49:21,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-17 05:49:21,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:21,481 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:21,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086289342] [2025-03-17 05:49:21,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086289342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:21,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:21,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:49:21,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142370674] [2025-03-17 05:49:21,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:21,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:49:21,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:21,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:49:21,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:49:21,499 INFO L87 Difference]: Start difference. First operand has 107 states, 93 states have (on average 1.4731182795698925) internal successors, (137), 94 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:49:21,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:21,518 INFO L93 Difference]: Finished difference Result 211 states and 327 transitions. [2025-03-17 05:49:21,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:49:21,521 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-17 05:49:21,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:21,526 INFO L225 Difference]: With dead ends: 211 [2025-03-17 05:49:21,527 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 05:49:21,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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:49:21,532 INFO L435 NwaCegarLoop]: 153 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, 153 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:49:21,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 05:49:21,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-17 05:49:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:49:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2025-03-17 05:49:21,568 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 108 [2025-03-17 05:49:21,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:21,568 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2025-03-17 05:49:21,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:49:21,569 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2025-03-17 05:49:21,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:49:21,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:21,572 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:21,582 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:49:21,772 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:49:21,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:21,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:21,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2073987370, now seen corresponding path program 1 times [2025-03-17 05:49:21,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:21,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344847913] [2025-03-17 05:49:21,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:21,774 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:49:21,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:21,776 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:49:21,777 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:49:21,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:49:22,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:49:22,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:22,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:22,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:49:22,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-17 05:49:22,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:22,195 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:22,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344847913] [2025-03-17 05:49:22,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344847913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:22,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:22,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:49:22,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619702876] [2025-03-17 05:49:22,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:22,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:49:22,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:22,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:49:22,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:49:22,197 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:49:22,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:22,270 INFO L93 Difference]: Finished difference Result 211 states and 308 transitions. [2025-03-17 05:49:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:49:22,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-17 05:49:22,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:22,272 INFO L225 Difference]: With dead ends: 211 [2025-03-17 05:49:22,272 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 05:49:22,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 105 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:49:22,273 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:22,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:22,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 05:49:22,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-17 05:49:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:49:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2025-03-17 05:49:22,288 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 108 [2025-03-17 05:49:22,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:22,292 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2025-03-17 05:49:22,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:49:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2025-03-17 05:49:22,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:49:22,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:22,293 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:22,304 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:49:22,494 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:49:22,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:22,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:22,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1612903063, now seen corresponding path program 1 times [2025-03-17 05:49:22,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:22,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735897995] [2025-03-17 05:49:22,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:22,496 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:49:22,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:22,498 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:49:22,499 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:49:22,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:49:22,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:49:22,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:22,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:22,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:49:22,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:22,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:49:22,930 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 56 treesize of output 20 [2025-03-17 05:49:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:49:23,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:23,816 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:23,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735897995] [2025-03-17 05:49:23,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735897995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:23,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:23,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:49:23,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620789172] [2025-03-17 05:49:23,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:23,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:49:23,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:23,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:49:23,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:49:23,817 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:25,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:49:28,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:49:29,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:49:31,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:49:32,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:49:33,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:33,047 INFO L93 Difference]: Finished difference Result 349 states and 502 transitions. [2025-03-17 05:49:33,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:49:33,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-17 05:49:33,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:33,055 INFO L225 Difference]: With dead ends: 349 [2025-03-17 05:49:33,055 INFO L226 Difference]: Without dead ends: 243 [2025-03-17 05:49:33,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:33,056 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 241 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:33,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 322 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2025-03-17 05:49:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-17 05:49:33,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 210. [2025-03-17 05:49:33,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 185 states have (on average 1.3945945945945946) internal successors, (258), 185 states have internal predecessors, (258), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:49:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 302 transitions. [2025-03-17 05:49:33,074 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 302 transitions. Word has length 108 [2025-03-17 05:49:33,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:33,076 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 302 transitions. [2025-03-17 05:49:33,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 302 transitions. [2025-03-17 05:49:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:49:33,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:33,077 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:33,089 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:49:33,277 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:49:33,278 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:33,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:33,278 INFO L85 PathProgramCache]: Analyzing trace with hash -88349551, now seen corresponding path program 1 times [2025-03-17 05:49:33,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:33,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691431951] [2025-03-17 05:49:33,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:33,279 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:49:33,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:33,281 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:49:33,282 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:49:33,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:49:33,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:49:33,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:33,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:33,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:49:33,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:49:33,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:33,627 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:33,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691431951] [2025-03-17 05:49:33,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691431951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:33,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:33,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:49:33,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252346221] [2025-03-17 05:49:33,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:33,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:33,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:33,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:33,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:33,629 INFO L87 Difference]: Start difference. First operand 210 states and 302 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:33,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:33,674 INFO L93 Difference]: Finished difference Result 429 states and 617 transitions. [2025-03-17 05:49:33,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:49:33,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-03-17 05:49:33,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:33,676 INFO L225 Difference]: With dead ends: 429 [2025-03-17 05:49:33,676 INFO L226 Difference]: Without dead ends: 220 [2025-03-17 05:49:33,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:33,677 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:33,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 576 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:33,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-17 05:49:33,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2025-03-17 05:49:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 193 states have (on average 1.378238341968912) internal successors, (266), 193 states have internal predecessors, (266), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:49:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 310 transitions. [2025-03-17 05:49:33,695 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 310 transitions. Word has length 109 [2025-03-17 05:49:33,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:33,695 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 310 transitions. [2025-03-17 05:49:33,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 310 transitions. [2025-03-17 05:49:33,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:49:33,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:33,696 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:33,707 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:49:33,897 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:49:33,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:33,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:33,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1895804014, now seen corresponding path program 1 times [2025-03-17 05:49:33,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:33,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966097151] [2025-03-17 05:49:33,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:33,898 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:49:33,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:33,900 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:49:33,900 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:49:34,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:49:34,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:49:34,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:34,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:34,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:49:34,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:34,266 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:49:34,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:34,266 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:34,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966097151] [2025-03-17 05:49:34,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966097151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:34,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:34,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:49:34,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609669814] [2025-03-17 05:49:34,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:34,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:49:34,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:34,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:49:34,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:34,267 INFO L87 Difference]: Start difference. First operand 218 states and 310 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:34,319 INFO L93 Difference]: Finished difference Result 441 states and 627 transitions. [2025-03-17 05:49:34,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:49:34,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-03-17 05:49:34,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:34,321 INFO L225 Difference]: With dead ends: 441 [2025-03-17 05:49:34,321 INFO L226 Difference]: Without dead ends: 224 [2025-03-17 05:49:34,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:34,322 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:34,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 710 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:34,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-17 05:49:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2025-03-17 05:49:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 197 states have (on average 1.3705583756345177) internal successors, (270), 197 states have internal predecessors, (270), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:49:34,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 314 transitions. [2025-03-17 05:49:34,335 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 314 transitions. Word has length 109 [2025-03-17 05:49:34,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:34,335 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 314 transitions. [2025-03-17 05:49:34,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 314 transitions. [2025-03-17 05:49:34,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:49:34,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:34,336 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:34,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 05:49:34,536 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:49:34,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:34,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:34,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1008300333, now seen corresponding path program 1 times [2025-03-17 05:49:34,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:34,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010319651] [2025-03-17 05:49:34,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:34,538 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:49:34,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:34,539 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:49:34,540 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:49:34,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:49:34,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:49:34,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:34,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:34,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:49:34,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:34,894 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:49:34,895 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:34,895 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:34,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010319651] [2025-03-17 05:49:34,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010319651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:34,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:34,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:49:34,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702228374] [2025-03-17 05:49:34,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:34,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:49:34,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:34,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:49:34,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:49:34,896 INFO L87 Difference]: Start difference. First operand 222 states and 314 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:34,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:34,964 INFO L93 Difference]: Finished difference Result 449 states and 635 transitions. [2025-03-17 05:49:34,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:49:34,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-03-17 05:49:34,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:34,966 INFO L225 Difference]: With dead ends: 449 [2025-03-17 05:49:34,966 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 05:49:34,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:49:34,967 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:34,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 845 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:34,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 05:49:34,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2025-03-17 05:49:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 201 states have (on average 1.36318407960199) internal successors, (274), 201 states have internal predecessors, (274), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:49:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 318 transitions. [2025-03-17 05:49:34,988 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 318 transitions. Word has length 109 [2025-03-17 05:49:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:34,988 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 318 transitions. [2025-03-17 05:49:34,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:34,988 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 318 transitions. [2025-03-17 05:49:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:49:34,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:34,989 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:35,000 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:49:35,190 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:49:35,190 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:35,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:35,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1007376812, now seen corresponding path program 1 times [2025-03-17 05:49:35,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:35,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256208772] [2025-03-17 05:49:35,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:35,191 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:49:35,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:35,193 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:49:35,194 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:49:35,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:49:35,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:49:35,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:35,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:35,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 05:49:35,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:36,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:49:36,537 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 62 treesize of output 38 [2025-03-17 05:49:36,608 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 98 treesize of output 50 [2025-03-17 05:49:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 05:49:50,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:49:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:49:52,010 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:52,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256208772] [2025-03-17 05:49:52,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256208772] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:49:52,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:49:52,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2025-03-17 05:49:52,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368052287] [2025-03-17 05:49:52,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:52,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:49:52,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:52,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:49:52,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=256, Unknown=3, NotChecked=0, Total=306 [2025-03-17 05:49:52,012 INFO L87 Difference]: Start difference. First operand 226 states and 318 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:54,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 05:49:56,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 05:49:57,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:57,618 INFO L93 Difference]: Finished difference Result 590 states and 817 transitions. [2025-03-17 05:49:57,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:49:57,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-03-17 05:49:57,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:57,620 INFO L225 Difference]: With dead ends: 590 [2025-03-17 05:49:57,620 INFO L226 Difference]: Without dead ends: 365 [2025-03-17 05:49:57,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=69, Invalid=390, Unknown=3, NotChecked=0, Total=462 [2025-03-17 05:49:57,621 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 75 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:57,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1086 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-17 05:49:57,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-17 05:49:57,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 356. [2025-03-17 05:49:57,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 325 states have (on average 1.3415384615384616) internal successors, (436), 327 states have internal predecessors, (436), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:49:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 488 transitions. [2025-03-17 05:49:57,640 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 488 transitions. Word has length 109 [2025-03-17 05:49:57,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:57,641 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 488 transitions. [2025-03-17 05:49:57,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:49:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 488 transitions. [2025-03-17 05:49:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:49:57,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:57,642 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:57,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 05:49:57,843 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:49:57,843 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:57,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:57,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1517910989, now seen corresponding path program 1 times [2025-03-17 05:49:57,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:57,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889123169] [2025-03-17 05:49:57,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:57,844 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:49:57,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:57,846 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:49:57,847 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:49:57,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:49:58,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:49:58,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:58,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:58,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:49:58,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:58,365 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 45 treesize of output 21 [2025-03-17 05:49:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:49:58,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:58,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:58,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889123169] [2025-03-17 05:49:58,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889123169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:58,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:58,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:49:58,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261856861] [2025-03-17 05:49:58,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:58,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:58,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:58,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:58,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:58,455 INFO L87 Difference]: Start difference. First operand 356 states and 488 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:50:00,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:50:03,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:50:04,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:04,075 INFO L93 Difference]: Finished difference Result 709 states and 971 transitions. [2025-03-17 05:50:04,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:50:04,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-03-17 05:50:04,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:04,078 INFO L225 Difference]: With dead ends: 709 [2025-03-17 05:50:04,078 INFO L226 Difference]: Without dead ends: 354 [2025-03-17 05:50:04,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:50:04,079 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 67 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:04,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 532 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-03-17 05:50:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-17 05:50:04,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 350. [2025-03-17 05:50:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 319 states have (on average 1.3385579937304075) internal successors, (427), 321 states have internal predecessors, (427), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:50:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 479 transitions. [2025-03-17 05:50:04,092 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 479 transitions. Word has length 109 [2025-03-17 05:50:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:04,093 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 479 transitions. [2025-03-17 05:50:04,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:50:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 479 transitions. [2025-03-17 05:50:04,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:50:04,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:04,094 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:04,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-17 05:50:04,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:50:04,294 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:04,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:04,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1210381141, now seen corresponding path program 1 times [2025-03-17 05:50:04,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:50:04,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387010257] [2025-03-17 05:50:04,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:04,295 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:50:04,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:50:04,297 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:50:04,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-17 05:50:04,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:50:04,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:50:04,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:04,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:04,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:50:04,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:50:04,825 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 46 treesize of output 22 [2025-03-17 05:50:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:50:04,919 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:50:04,919 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:50:04,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387010257] [2025-03-17 05:50:04,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387010257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:04,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:04,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:50:04,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143844158] [2025-03-17 05:50:04,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:04,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:50:04,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:50:04,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:50:04,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:50:04,920 INFO L87 Difference]: Start difference. First operand 350 states and 479 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:50:07,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:50:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:10,536 INFO L93 Difference]: Finished difference Result 767 states and 1044 transitions. [2025-03-17 05:50:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:50:10,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-03-17 05:50:10,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:10,540 INFO L225 Difference]: With dead ends: 767 [2025-03-17 05:50:10,540 INFO L226 Difference]: Without dead ends: 418 [2025-03-17 05:50:10,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:50:10,540 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 67 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:10,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 568 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-03-17 05:50:10,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-17 05:50:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 330. [2025-03-17 05:50:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 301 states have (on average 1.3421926910299002) internal successors, (404), 302 states have internal predecessors, (404), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:50:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 452 transitions. [2025-03-17 05:50:10,555 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 452 transitions. Word has length 109 [2025-03-17 05:50:10,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:10,555 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 452 transitions. [2025-03-17 05:50:10,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:50:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 452 transitions. [2025-03-17 05:50:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:50:10,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:10,556 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:10,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-17 05:50:10,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:50:10,757 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:10,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:10,758 INFO L85 PathProgramCache]: Analyzing trace with hash 699846964, now seen corresponding path program 1 times [2025-03-17 05:50:10,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:50:10,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47234220] [2025-03-17 05:50:10,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:10,758 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:50:10,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:50:10,760 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:50:10,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-17 05:50:10,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:50:11,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:50:11,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:11,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:11,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:50:11,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:50:14,782 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 70 treesize of output 34 [2025-03-17 05:50:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 05:50:14,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:50:16,322 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-17 05:50:16,322 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 74 treesize of output 45 [2025-03-17 05:50:16,692 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:50:16,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47234220] [2025-03-17 05:50:16,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47234220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:50:16,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [516067830] [2025-03-17 05:50:16,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:16,693 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:50:16,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:50:16,716 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:50:16,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-17 05:50:16,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:50:17,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:50:17,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:17,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:17,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 05:50:17,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:50:18,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:50:20,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:50:20,500 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:50:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 8 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:50:21,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:50:21,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:50:21,823 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 100 treesize of output 1 [2025-03-17 05:50:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:50:21,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [516067830] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:50:21,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:50:21,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 8] total 18 [2025-03-17 05:50:21,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526296102] [2025-03-17 05:50:21,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:21,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:50:21,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:50:21,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:50:21,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:50:21,873 INFO L87 Difference]: Start difference. First operand 330 states and 452 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:50:23,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:50:25,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:50:25,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:25,814 INFO L93 Difference]: Finished difference Result 660 states and 904 transitions. [2025-03-17 05:50:25,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:50:25,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2025-03-17 05:50:25,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:25,816 INFO L225 Difference]: With dead ends: 660 [2025-03-17 05:50:25,817 INFO L226 Difference]: Without dead ends: 331 [2025-03-17 05:50:25,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 398 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:50:25,818 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:25,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 394 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-17 05:50:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-17 05:50:25,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 330. [2025-03-17 05:50:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 301 states have (on average 1.3355481727574752) internal successors, (402), 302 states have internal predecessors, (402), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:50:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 450 transitions. [2025-03-17 05:50:25,830 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 450 transitions. Word has length 109 [2025-03-17 05:50:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:25,830 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 450 transitions. [2025-03-17 05:50:25,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:50:25,831 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 450 transitions. [2025-03-17 05:50:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:50:25,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:25,832 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:25,843 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 (11)] Ended with exit code 0 [2025-03-17 05:50:26,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2025-03-17 05:50:26,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:50:26,233 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:26,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:26,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1445537930, now seen corresponding path program 1 times [2025-03-17 05:50:26,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:50:26,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716447822] [2025-03-17 05:50:26,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:26,233 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:50:26,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:50:26,235 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:50:26,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-03-17 05:50:26,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:50:26,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:50:26,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:26,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:26,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:50:26,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:50:30,624 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 70 treesize of output 34 [2025-03-17 05:50:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 05:50:30,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:50:32,418 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-17 05:50:32,418 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 74 treesize of output 45 [2025-03-17 05:50:32,814 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:50:32,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716447822] [2025-03-17 05:50:32,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716447822] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:50:32,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [50567192] [2025-03-17 05:50:32,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:32,815 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:50:32,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:50:32,816 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:50:32,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2025-03-17 05:50:33,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:50:34,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:50:34,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:34,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:34,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 05:50:34,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:50:35,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:50:35,098 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:50:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-17 05:50:35,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:50:35,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [50567192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:35,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:50:35,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-03-17 05:50:35,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664043662] [2025-03-17 05:50:35,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:35,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:50:35,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:50:35,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:50:35,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:50:35,428 INFO L87 Difference]: Start difference. First operand 330 states and 450 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:50:38,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:50:40,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:50:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:41,329 INFO L93 Difference]: Finished difference Result 661 states and 901 transitions. [2025-03-17 05:50:41,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:50:41,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2025-03-17 05:50:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:41,331 INFO L225 Difference]: With dead ends: 661 [2025-03-17 05:50:41,331 INFO L226 Difference]: Without dead ends: 332 [2025-03-17 05:50:41,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:50:41,332 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 126 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:41,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 390 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-03-17 05:50:41,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-17 05:50:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2025-03-17 05:50:41,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 301 states have (on average 1.3289036544850499) internal successors, (400), 302 states have internal predecessors, (400), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:50:41,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 448 transitions. [2025-03-17 05:50:41,341 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 448 transitions. Word has length 111 [2025-03-17 05:50:41,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:41,342 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 448 transitions. [2025-03-17 05:50:41,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:50:41,342 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 448 transitions. [2025-03-17 05:50:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:50:41,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:41,343 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:41,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2025-03-17 05:50:41,554 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 (13)] Ended with exit code 0 [2025-03-17 05:50:41,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /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:50:41,744 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:41,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:41,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1607308620, now seen corresponding path program 1 times [2025-03-17 05:50:41,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:50:41,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511221747] [2025-03-17 05:50:41,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:41,745 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:50:41,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:50:41,747 INFO L229 MonitoredProcess]: Starting monitored process 15 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:50:41,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-03-17 05:50:41,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:50:42,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:50:42,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:42,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:42,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:50:42,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:50:46,079 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 70 treesize of output 34 [2025-03-17 05:50:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 05:50:46,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:50:47,833 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-17 05:50:47,833 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 74 treesize of output 45 [2025-03-17 05:50:48,225 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:50:48,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511221747] [2025-03-17 05:50:48,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511221747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:50:48,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [924854670] [2025-03-17 05:50:48,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:48,225 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:50:48,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:50:48,227 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:50:48,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process