./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-96.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 a853c07cdb9387b63b93be13a2dc9697d60053474c0652611eb00fce1c18c0e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:46:01,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:46:01,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:46:01,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:46:01,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:46:01,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:46:01,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:46:01,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:46:01,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:46:01,414 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:46:01,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:46:01,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:46:01,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:46:01,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:46:01,416 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:46:01,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:46:01,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:46:01,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:46:01,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:46:01,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:46:01,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:46:01,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:46:01,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:46:01,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:46:01,417 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:46:01,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:46:01,417 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:46:01,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:46:01,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:46:01,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:46:01,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:46:01,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:46:01,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:46:01,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:46:01,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:46:01,418 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:46:01,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:46:01,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:46:01,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:46:01,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:46:01,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:46:01,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:46:01,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:46:01,419 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 -> a853c07cdb9387b63b93be13a2dc9697d60053474c0652611eb00fce1c18c0e9 [2025-03-08 16:46:01,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:46:01,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:46:01,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:46:01,630 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:46:01,630 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:46:01,631 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-96.i [2025-03-08 16:46:02,772 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ca23871e/7c0e2d52d00e40d1bda2c6ba8e7f6da5/FLAGbfb074188 [2025-03-08 16:46:03,034 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:46:03,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-96.i [2025-03-08 16:46:03,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ca23871e/7c0e2d52d00e40d1bda2c6ba8e7f6da5/FLAGbfb074188 [2025-03-08 16:46:03,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ca23871e/7c0e2d52d00e40d1bda2c6ba8e7f6da5 [2025-03-08 16:46:03,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:46:03,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:46:03,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:46:03,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:46:03,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:46:03,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:46:03" (1/1) ... [2025-03-08 16:46:03,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:03, skipping insertion in model container [2025-03-08 16:46:03,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:46:03" (1/1) ... [2025-03-08 16:46:03,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:46:03,472 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-96.i[916,929] [2025-03-08 16:46:03,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:46:03,513 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:46:03,519 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-96.i[916,929] [2025-03-08 16:46:03,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:46:03,555 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:46:03,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:03 WrapperNode [2025-03-08 16:46:03,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:46:03,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:46:03,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:46:03,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:46:03,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:03" (1/1) ... [2025-03-08 16:46:03,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:03" (1/1) ... [2025-03-08 16:46:03,609 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 517 [2025-03-08 16:46:03,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:46:03,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:46:03,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:46:03,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:46:03,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:03" (1/1) ... [2025-03-08 16:46:03,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:03" (1/1) ... [2025-03-08 16:46:03,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:03" (1/1) ... [2025-03-08 16:46:03,648 INFO L175 MemorySlicer]: Split 127 memory accesses to 16 slices as follows [2, 15, 6, 14, 12, 6, 8, 6, 6, 5, 10, 10, 15, 3, 3, 6]. 12 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2025-03-08 16:46:03,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:03" (1/1) ... [2025-03-08 16:46:03,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:03" (1/1) ... [2025-03-08 16:46:03,670 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:03" (1/1) ... [2025-03-08 16:46:03,676 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:03" (1/1) ... [2025-03-08 16:46:03,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:03" (1/1) ... [2025-03-08 16:46:03,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:03" (1/1) ... [2025-03-08 16:46:03,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:46:03,697 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:46:03,697 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:46:03,697 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:46:03,698 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:03" (1/1) ... [2025-03-08 16:46:03,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:46:03,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:46:03,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-08 16:46:03,734 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-08 16:46:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:46:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-08 16:46:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-08 16:46:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-08 16:46:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-08 16:46:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-08 16:46:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-08 16:46:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-08 16:46:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-08 16:46:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-08 16:46:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-08 16:46:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-08 16:46:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-03-08 16:46:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-03-08 16:46:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-03-08 16:46:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-03-08 16:46:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2025-03-08 16:46:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:46:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:46:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:46:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:46:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:46:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:46:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 16:46:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 16:46:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 16:46:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 16:46:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 16:46:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 16:46:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 16:46:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 16:46:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 16:46:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 16:46:03,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 16:46:03,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 16:46:03,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-08 16:46:03,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 16:46:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:46:03,756 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 16:46:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 16:46:03,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 16:46:03,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 16:46:03,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 16:46:03,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 16:46:03,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 16:46:03,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 16:46:03,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:46:03,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:46:03,907 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:46:03,908 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:46:04,263 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: havoc property_#t~ite85#1;havoc property_#t~mem82#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem86#1;havoc property_#t~ite100#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short89#1;havoc property_#t~ite99#1;havoc property_#t~mem90#1;havoc property_#t~ite98#1;havoc property_#t~mem95#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~short94#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~ite105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~ite121#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite120#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short122#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~short125#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~short128#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short131#1; [2025-03-08 16:46:04,297 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2025-03-08 16:46:04,297 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:46:04,305 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:46:04,306 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:46:04,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:46:04 BoogieIcfgContainer [2025-03-08 16:46:04,307 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:46:04,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:46:04,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:46:04,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:46:04,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:46:03" (1/3) ... [2025-03-08 16:46:04,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67203509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:46:04, skipping insertion in model container [2025-03-08 16:46:04,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:03" (2/3) ... [2025-03-08 16:46:04,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67203509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:46:04, skipping insertion in model container [2025-03-08 16:46:04,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:46:04" (3/3) ... [2025-03-08 16:46:04,314 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-96.i [2025-03-08 16:46:04,323 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:46:04,324 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-96.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:46:04,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:46:04,373 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;@6f736715, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:46:04,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:46:04,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 89 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:46:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:46:04,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:04,384 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:04,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:04,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:04,388 INFO L85 PathProgramCache]: Analyzing trace with hash -988562694, now seen corresponding path program 1 times [2025-03-08 16:46:04,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:46:04,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882019071] [2025-03-08 16:46:04,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:04,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:46:04,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:46:04,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:46:04,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:04,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 16:46:04,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:46:04,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882019071] [2025-03-08 16:46:04,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882019071] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:46:04,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595382007] [2025-03-08 16:46:04,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:04,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:46:04,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:46:04,677 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-08 16:46:04,679 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-08 16:46:04,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:46:04,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:46:04,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:04,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:04,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:46:04,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:46:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 16:46:04,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:46:04,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595382007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:04,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:46:04,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:46:04,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55300254] [2025-03-08 16:46:04,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:04,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:46:04,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:46:04,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:46:04,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:46:04,958 INFO L87 Difference]: Start difference. First operand has 107 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 89 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:46:04,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:04,976 INFO L93 Difference]: Finished difference Result 208 states and 325 transitions. [2025-03-08 16:46:04,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:46:04,977 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2025-03-08 16:46:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:04,981 INFO L225 Difference]: With dead ends: 208 [2025-03-08 16:46:04,981 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 16:46:04,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-08 16:46:04,985 INFO L435 NwaCegarLoop]: 152 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, 152 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-08 16:46:04,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:46:04,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 16:46:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-08 16:46:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:46:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2025-03-08 16:46:05,023 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 131 [2025-03-08 16:46:05,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:05,023 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2025-03-08 16:46:05,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:46:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2025-03-08 16:46:05,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:46:05,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:05,026 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:05,033 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-08 16:46:05,226 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-08 16:46:05,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:05,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:05,227 INFO L85 PathProgramCache]: Analyzing trace with hash -904630196, now seen corresponding path program 1 times [2025-03-08 16:46:05,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:46:05,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995900080] [2025-03-08 16:46:05,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:05,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:46:05,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:46:05,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:46:05,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:05,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:05,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:46:05,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995900080] [2025-03-08 16:46:05,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995900080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:05,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:05,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:46:05,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891618387] [2025-03-08 16:46:05,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:05,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:46:05,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:46:05,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:46:05,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:46:05,551 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:05,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:05,585 INFO L93 Difference]: Finished difference Result 208 states and 305 transitions. [2025-03-08 16:46:05,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:46:05,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-03-08 16:46:05,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:05,588 INFO L225 Difference]: With dead ends: 208 [2025-03-08 16:46:05,588 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 16:46:05,588 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-08 16:46:05,589 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 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-08 16:46:05,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:46:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 16:46:05,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2025-03-08 16:46:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:46:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2025-03-08 16:46:05,597 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 131 [2025-03-08 16:46:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:05,598 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2025-03-08 16:46:05,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2025-03-08 16:46:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:46:05,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:05,600 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:05,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:46:05,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:05,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:05,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1582882637, now seen corresponding path program 1 times [2025-03-08 16:46:05,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:46:05,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235065127] [2025-03-08 16:46:05,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:05,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:46:05,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:46:05,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:46:05,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:05,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:05,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:46:05,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235065127] [2025-03-08 16:46:05,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235065127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:05,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:05,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:46:05,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270171717] [2025-03-08 16:46:05,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:05,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:46:05,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:46:05,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:46:05,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:46:05,747 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:05,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:05,776 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2025-03-08 16:46:05,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:46:05,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-03-08 16:46:05,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:05,778 INFO L225 Difference]: With dead ends: 212 [2025-03-08 16:46:05,778 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 16:46:05,778 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-08 16:46:05,779 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 437 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-08 16:46:05,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 437 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:46:05,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 16:46:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-03-08 16:46:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:46:05,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2025-03-08 16:46:05,792 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 131 [2025-03-08 16:46:05,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:05,793 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2025-03-08 16:46:05,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:05,793 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2025-03-08 16:46:05,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:46:05,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:05,796 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:05,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:46:05,796 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:05,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:05,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1824580978, now seen corresponding path program 1 times [2025-03-08 16:46:05,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:46:05,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207920021] [2025-03-08 16:46:05,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:05,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:46:05,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:46:05,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:46:05,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:05,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:05,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:46:05,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207920021] [2025-03-08 16:46:05,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207920021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:05,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:05,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:46:05,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401188722] [2025-03-08 16:46:05,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:05,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:46:05,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:46:05,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:46:05,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:46:05,954 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:05,976 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2025-03-08 16:46:05,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:46:05,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-03-08 16:46:05,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:05,977 INFO L225 Difference]: With dead ends: 216 [2025-03-08 16:46:05,979 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 16:46:05,979 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-08 16:46:05,980 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 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-08 16:46:05,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:46:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 16:46:05,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-03-08 16:46:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:46:05,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2025-03-08 16:46:05,990 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 131 [2025-03-08 16:46:05,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:05,990 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2025-03-08 16:46:05,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:05,991 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2025-03-08 16:46:05,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:46:05,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:05,992 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:05,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:46:05,992 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:05,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:05,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1823657457, now seen corresponding path program 1 times [2025-03-08 16:46:05,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:46:05,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288011468] [2025-03-08 16:46:05,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:05,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:46:06,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:46:06,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:46:06,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:06,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:06,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:46:06,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288011468] [2025-03-08 16:46:06,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288011468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:06,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:06,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:46:06,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729082653] [2025-03-08 16:46:06,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:06,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:46:06,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:46:06,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:46:06,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:46:06,259 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:06,310 INFO L93 Difference]: Finished difference Result 219 states and 316 transitions. [2025-03-08 16:46:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:46:06,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-03-08 16:46:06,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:06,311 INFO L225 Difference]: With dead ends: 219 [2025-03-08 16:46:06,312 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 16:46:06,312 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-08 16:46:06,313 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:06,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 567 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:46:06,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 16:46:06,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-08 16:46:06,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:46:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2025-03-08 16:46:06,323 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 131 [2025-03-08 16:46:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:06,323 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2025-03-08 16:46:06,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2025-03-08 16:46:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:46:06,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:06,324 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:06,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:46:06,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:06,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:06,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1626837968, now seen corresponding path program 1 times [2025-03-08 16:46:06,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:46:06,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949987731] [2025-03-08 16:46:06,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:06,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:46:06,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:46:06,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:46:06,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:06,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:07,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:46:07,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949987731] [2025-03-08 16:46:07,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949987731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:07,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:07,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:46:07,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016323567] [2025-03-08 16:46:07,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:07,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:46:07,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:46:07,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:46:07,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:46:07,247 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 16:46:07,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:07,544 INFO L93 Difference]: Finished difference Result 294 states and 419 transitions. [2025-03-08 16:46:07,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:46:07,544 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 131 [2025-03-08 16:46:07,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:07,545 INFO L225 Difference]: With dead ends: 294 [2025-03-08 16:46:07,546 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 16:46:07,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:46:07,547 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 260 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:07,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 754 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:46:07,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 16:46:07,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2025-03-08 16:46:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 159 states have (on average 1.3773584905660377) internal successors, (219), 160 states have internal predecessors, (219), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:46:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 259 transitions. [2025-03-08 16:46:07,566 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 259 transitions. Word has length 131 [2025-03-08 16:46:07,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:07,567 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 259 transitions. [2025-03-08 16:46:07,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 16:46:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 259 transitions. [2025-03-08 16:46:07,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:46:07,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:07,568 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:07,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:46:07,568 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:07,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:07,569 INFO L85 PathProgramCache]: Analyzing trace with hash -466842354, now seen corresponding path program 1 times [2025-03-08 16:46:07,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:46:07,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111311561] [2025-03-08 16:46:07,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:07,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:46:07,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:46:07,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:46:07,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:07,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:07,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:46:07,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111311561] [2025-03-08 16:46:07,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111311561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:07,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:07,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:46:07,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135317598] [2025-03-08 16:46:07,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:07,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:46:07,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:46:07,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:46:07,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:46:07,637 INFO L87 Difference]: Start difference. First operand 182 states and 259 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:07,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:07,659 INFO L93 Difference]: Finished difference Result 399 states and 566 transitions. [2025-03-08 16:46:07,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:46:07,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-03-08 16:46:07,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:07,661 INFO L225 Difference]: With dead ends: 399 [2025-03-08 16:46:07,661 INFO L226 Difference]: Without dead ends: 220 [2025-03-08 16:46:07,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:46:07,663 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 66 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:07,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 327 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:46:07,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-08 16:46:07,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 182. [2025-03-08 16:46:07,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 159 states have (on average 1.371069182389937) internal successors, (218), 160 states have internal predecessors, (218), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:46:07,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 258 transitions. [2025-03-08 16:46:07,677 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 258 transitions. Word has length 133 [2025-03-08 16:46:07,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:07,677 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 258 transitions. [2025-03-08 16:46:07,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:07,677 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 258 transitions. [2025-03-08 16:46:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:46:07,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:07,679 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:07,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:46:07,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:07,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:07,680 INFO L85 PathProgramCache]: Analyzing trace with hash 60842126, now seen corresponding path program 1 times [2025-03-08 16:46:07,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:46:07,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376950571] [2025-03-08 16:46:07,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:07,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:46:07,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:46:07,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:46:07,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:07,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:07,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:46:07,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376950571] [2025-03-08 16:46:07,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376950571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:07,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:07,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:46:07,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49174701] [2025-03-08 16:46:07,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:07,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:46:07,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:46:07,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:46:07,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:46:07,761 INFO L87 Difference]: Start difference. First operand 182 states and 258 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:07,786 INFO L93 Difference]: Finished difference Result 360 states and 509 transitions. [2025-03-08 16:46:07,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:46:07,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-03-08 16:46:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:07,788 INFO L225 Difference]: With dead ends: 360 [2025-03-08 16:46:07,788 INFO L226 Difference]: Without dead ends: 181 [2025-03-08 16:46:07,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:46:07,788 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 64 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:07,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 291 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:46:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-08 16:46:07,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2025-03-08 16:46:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 155 states have (on average 1.3612903225806452) internal successors, (211), 156 states have internal predecessors, (211), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:46:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 251 transitions. [2025-03-08 16:46:07,801 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 251 transitions. Word has length 133 [2025-03-08 16:46:07,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:07,801 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 251 transitions. [2025-03-08 16:46:07,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 251 transitions. [2025-03-08 16:46:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:46:07,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:07,803 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:07,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:46:07,803 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:07,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:07,804 INFO L85 PathProgramCache]: Analyzing trace with hash -464681566, now seen corresponding path program 1 times [2025-03-08 16:46:07,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:46:07,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286371492] [2025-03-08 16:46:07,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:07,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:46:07,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:46:07,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:46:07,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:07,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 16:46:07,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:46:07,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286371492] [2025-03-08 16:46:07,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286371492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:46:07,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35796876] [2025-03-08 16:46:07,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:07,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:46:07,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:46:07,967 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-08 16:46:07,970 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-08 16:46:08,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:46:08,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:46:08,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:08,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:08,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:46:08,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:46:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:08,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:46:08,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35796876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:08,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:46:08,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 16:46:08,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798336898] [2025-03-08 16:46:08,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:08,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:46:08,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:46:08,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:46:08,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:46:08,219 INFO L87 Difference]: Start difference. First operand 178 states and 251 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:08,253 INFO L93 Difference]: Finished difference Result 359 states and 507 transitions. [2025-03-08 16:46:08,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:46:08,254 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-03-08 16:46:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:08,255 INFO L225 Difference]: With dead ends: 359 [2025-03-08 16:46:08,255 INFO L226 Difference]: Without dead ends: 184 [2025-03-08 16:46:08,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:46:08,257 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:08,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 579 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:46:08,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-08 16:46:08,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-03-08 16:46:08,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 161 states have (on average 1.3478260869565217) internal successors, (217), 162 states have internal predecessors, (217), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:46:08,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 257 transitions. [2025-03-08 16:46:08,280 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 257 transitions. Word has length 133 [2025-03-08 16:46:08,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:08,280 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 257 transitions. [2025-03-08 16:46:08,280 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:08,280 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 257 transitions. [2025-03-08 16:46:08,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:46:08,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:08,282 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:08,289 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-08 16:46:08,483 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,SelfDestructingSolverStorable8 [2025-03-08 16:46:08,483 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:08,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:08,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1921252788, now seen corresponding path program 1 times [2025-03-08 16:46:08,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:46:08,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567817245] [2025-03-08 16:46:08,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:08,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:46:08,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:46:08,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:46:08,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:08,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:08,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:46:08,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567817245] [2025-03-08 16:46:08,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567817245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:08,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:08,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:46:08,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641520401] [2025-03-08 16:46:08,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:08,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:46:08,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:46:08,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:46:08,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:46:08,615 INFO L87 Difference]: Start difference. First operand 184 states and 257 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:08,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:08,711 INFO L93 Difference]: Finished difference Result 538 states and 748 transitions. [2025-03-08 16:46:08,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:46:08,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2025-03-08 16:46:08,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:08,714 INFO L225 Difference]: With dead ends: 538 [2025-03-08 16:46:08,714 INFO L226 Difference]: Without dead ends: 357 [2025-03-08 16:46:08,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:46:08,715 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 248 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:08,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 427 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:46:08,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-08 16:46:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 300. [2025-03-08 16:46:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 255 states have (on average 1.3254901960784313) internal successors, (338), 257 states have internal predecessors, (338), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 16:46:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 418 transitions. [2025-03-08 16:46:08,734 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 418 transitions. Word has length 135 [2025-03-08 16:46:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:08,735 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 418 transitions. [2025-03-08 16:46:08,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 418 transitions. [2025-03-08 16:46:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:46:08,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:08,737 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:08,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:46:08,737 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:08,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:08,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1526071981, now seen corresponding path program 1 times [2025-03-08 16:46:08,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:46:08,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955995103] [2025-03-08 16:46:08,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:08,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:46:08,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:46:08,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:46:08,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:08,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:08,831 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:08,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:46:08,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955995103] [2025-03-08 16:46:08,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955995103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:08,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:08,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:46:08,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819562551] [2025-03-08 16:46:08,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:08,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:46:08,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:46:08,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:46:08,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:46:08,834 INFO L87 Difference]: Start difference. First operand 300 states and 418 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:08,872 INFO L93 Difference]: Finished difference Result 592 states and 825 transitions. [2025-03-08 16:46:08,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:46:08,873 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), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-03-08 16:46:08,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:08,874 INFO L225 Difference]: With dead ends: 592 [2025-03-08 16:46:08,874 INFO L226 Difference]: Without dead ends: 304 [2025-03-08 16:46:08,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:46:08,875 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 61 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:08,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 432 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:46:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-08 16:46:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2025-03-08 16:46:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 257 states have (on average 1.3229571984435797) internal successors, (340), 259 states have internal predecessors, (340), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 16:46:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2025-03-08 16:46:08,900 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 136 [2025-03-08 16:46:08,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:08,901 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2025-03-08 16:46:08,901 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), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2025-03-08 16:46:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:46:08,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:08,905 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:08,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:46:08,905 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:08,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:08,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2036606158, now seen corresponding path program 1 times [2025-03-08 16:46:08,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:46:08,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859971858] [2025-03-08 16:46:08,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:08,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:46:08,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:46:08,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:46:08,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:08,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 16:46:09,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:46:09,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859971858] [2025-03-08 16:46:09,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859971858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:46:09,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791554411] [2025-03-08 16:46:09,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:09,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:46:09,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:46:09,061 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-08 16:46:09,062 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-08 16:46:09,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:46:09,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:46:09,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:09,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:09,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:46:09,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:46:09,294 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:09,294 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:46:09,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791554411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:09,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:46:09,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-08 16:46:09,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172505310] [2025-03-08 16:46:09,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:09,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:46:09,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:46:09,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:46:09,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:46:09,296 INFO L87 Difference]: Start difference. First operand 302 states and 420 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:09,338 INFO L93 Difference]: Finished difference Result 604 states and 839 transitions. [2025-03-08 16:46:09,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:46:09,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-03-08 16:46:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:09,341 INFO L225 Difference]: With dead ends: 604 [2025-03-08 16:46:09,342 INFO L226 Difference]: Without dead ends: 314 [2025-03-08 16:46:09,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:46:09,343 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:09,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 719 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:46:09,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-08 16:46:09,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 305. [2025-03-08 16:46:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 260 states have (on average 1.3192307692307692) internal successors, (343), 262 states have internal predecessors, (343), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 16:46:09,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 423 transitions. [2025-03-08 16:46:09,362 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 423 transitions. Word has length 136 [2025-03-08 16:46:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:09,362 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 423 transitions. [2025-03-08 16:46:09,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 423 transitions. [2025-03-08 16:46:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 16:46:09,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:09,364 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:09,372 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-08 16:46:09,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:46:09,565 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:09,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:09,566 INFO L85 PathProgramCache]: Analyzing trace with hash -425290794, now seen corresponding path program 1 times [2025-03-08 16:46:09,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:46:09,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089578567] [2025-03-08 16:46:09,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:09,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:46:09,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:46:09,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:46:09,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:09,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:09,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:46:09,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089578567] [2025-03-08 16:46:09,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089578567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:09,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:09,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:46:09,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448836928] [2025-03-08 16:46:09,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:09,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:46:09,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:46:09,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:46:09,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:46:09,671 INFO L87 Difference]: Start difference. First operand 305 states and 423 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:09,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:09,769 INFO L93 Difference]: Finished difference Result 642 states and 896 transitions. [2025-03-08 16:46:09,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:46:09,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2025-03-08 16:46:09,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:09,772 INFO L225 Difference]: With dead ends: 642 [2025-03-08 16:46:09,772 INFO L226 Difference]: Without dead ends: 349 [2025-03-08 16:46:09,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:46:09,773 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 136 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:09,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 719 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:46:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-08 16:46:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 337. [2025-03-08 16:46:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 279 states have (on average 1.2974910394265233) internal successors, (362), 281 states have internal predecessors, (362), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:46:09,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 466 transitions. [2025-03-08 16:46:09,797 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 466 transitions. Word has length 137 [2025-03-08 16:46:09,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:09,797 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 466 transitions. [2025-03-08 16:46:09,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:09,798 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 466 transitions. [2025-03-08 16:46:09,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 16:46:09,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:09,799 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:09,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:46:09,799 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:09,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:09,799 INFO L85 PathProgramCache]: Analyzing trace with hash -930849419, now seen corresponding path program 1 times [2025-03-08 16:46:09,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:46:09,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189355454] [2025-03-08 16:46:09,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:09,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:46:09,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:46:09,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:46:09,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:09,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:10,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:46:10,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189355454] [2025-03-08 16:46:10,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189355454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:10,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:10,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:46:10,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352981899] [2025-03-08 16:46:10,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:10,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:46:10,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:46:10,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:46:10,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:46:10,018 INFO L87 Difference]: Start difference. First operand 337 states and 466 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:10,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:10,072 INFO L93 Difference]: Finished difference Result 356 states and 485 transitions. [2025-03-08 16:46:10,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:46:10,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2025-03-08 16:46:10,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:10,074 INFO L225 Difference]: With dead ends: 356 [2025-03-08 16:46:10,074 INFO L226 Difference]: Without dead ends: 354 [2025-03-08 16:46:10,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:46:10,074 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 104 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:10,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 913 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:46:10,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-08 16:46:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-08 16:46:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 294 states have (on average 1.282312925170068) internal successors, (377), 296 states have internal predecessors, (377), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:46:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 481 transitions. [2025-03-08 16:46:10,093 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 481 transitions. Word has length 137 [2025-03-08 16:46:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:10,094 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 481 transitions. [2025-03-08 16:46:10,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 481 transitions. [2025-03-08 16:46:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 16:46:10,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:10,095 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:10,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:46:10,095 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:10,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:10,095 INFO L85 PathProgramCache]: Analyzing trace with hash -929925898, now seen corresponding path program 1 times [2025-03-08 16:46:10,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:46:10,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461147526] [2025-03-08 16:46:10,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:10,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:46:10,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:46:10,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:46:10,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:10,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:46:10,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:46:10,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:46:10,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:46:10,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:10,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:46:10,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:46:10,282 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:46:10,282 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:46:10,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:46:10,287 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:46:10,437 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:46:10,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:46:10 BoogieIcfgContainer [2025-03-08 16:46:10,441 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:46:10,441 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:46:10,441 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:46:10,442 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:46:10,442 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:46:04" (3/4) ... [2025-03-08 16:46:10,443 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:46:10,444 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:46:10,444 INFO L158 Benchmark]: Toolchain (without parser) took 7101.38ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 122.2MB in the beginning and 161.7MB in the end (delta: -39.5MB). Peak memory consumption was 175.7MB. Max. memory is 16.1GB. [2025-03-08 16:46:10,445 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:46:10,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.56ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 107.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:46:10,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.73ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 104.1MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:46:10,446 INFO L158 Benchmark]: Boogie Preprocessor took 86.62ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 99.6MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:46:10,446 INFO L158 Benchmark]: IcfgBuilder took 610.30ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 58.3MB in the end (delta: 41.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 16:46:10,446 INFO L158 Benchmark]: TraceAbstraction took 6132.01ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 57.6MB in the beginning and 161.8MB in the end (delta: -104.2MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. [2025-03-08 16:46:10,446 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 377.5MB. Free memory was 161.8MB in the beginning and 161.7MB in the end (delta: 78.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:46:10,447 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.56ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 107.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.73ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 104.1MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 86.62ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 99.6MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 610.30ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 58.3MB in the end (delta: 41.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6132.01ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 57.6MB in the beginning and 161.8MB in the end (delta: -104.2MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 377.5MB. Free memory was 161.8MB in the beginning and 161.7MB in the end (delta: 78.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L22] unsigned short int var_1_1 = 8; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned short int var_1_3 = 8; [L26] unsigned short int var_1_3 = 8; [L27] unsigned short int* var_1_3_Pointer = &(var_1_3); [L28] unsigned short int var_1_4 = 1000; [L28] unsigned short int var_1_4 = 1000; [L29] unsigned short int* var_1_4_Pointer = &(var_1_4); [L30] unsigned char var_1_5 = 1; [L30] unsigned char var_1_5 = 1; [L31] unsigned char* var_1_5_Pointer = &(var_1_5); [L32] unsigned char var_1_6 = 0; [L32] unsigned char var_1_6 = 0; [L33] unsigned char* var_1_6_Pointer = &(var_1_6); [L34] unsigned char var_1_9 = 0; [L34] unsigned char var_1_9 = 0; [L35] unsigned char* var_1_9_Pointer = &(var_1_9); [L36] unsigned char var_1_10 = 0; [L36] unsigned char var_1_10 = 0; [L37] unsigned char* var_1_10_Pointer = &(var_1_10); [L38] double var_1_11 = 4.575; [L38] double var_1_11 = 4.575; [L39] double* var_1_11_Pointer = &(var_1_11); [L40] double var_1_13 = 2.75; [L40] double var_1_13 = 2.75; [L41] double* var_1_13_Pointer = &(var_1_13); [L42] double var_1_14 = 128.5; [L42] double var_1_14 = 128.5; [L43] double* var_1_14_Pointer = &(var_1_14); [L44] signed long int var_1_15 = -1000000000; [L44] signed long int var_1_15 = -1000000000; [L45] signed long int* var_1_15_Pointer = &(var_1_15); [L46] float var_1_16 = 99999.25; [L46] float var_1_16 = 99999.25; [L47] float* var_1_16_Pointer = &(var_1_16); [L48] signed char var_1_17 = 1; [L48] signed char var_1_17 = 1; [L49] signed char* var_1_17_Pointer = &(var_1_17); [L50] signed char var_1_18 = 50; [L50] signed char var_1_18 = 50; [L51] signed char* var_1_18_Pointer = &(var_1_18); [L52] unsigned char last_1_var_1_5 = 1; VAL [isInitial=0, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L117] isInitial = 1 [L118] FCALL initially() [L119] COND TRUE 1 [L120] CALL updateLastVariables() [L110] EXPR \read(var_1_5) [L110] last_1_var_1_5 = var_1_5 [L120] RET updateLastVariables() [L121] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_uchar() [L84] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] var_1_3 = __VERIFIER_nondet_ushort() [L87] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] var_1_4 = __VERIFIER_nondet_ushort() [L90] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] var_1_6 = __VERIFIER_nondet_uchar() [L93] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] var_1_9 = __VERIFIER_nondet_uchar() [L96] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] var_1_10 = __VERIFIER_nondet_uchar() [L99] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] var_1_13 = __VERIFIER_nondet_double() [L102] EXPR \read(var_1_13) [L102] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F [L102] EXPR \read(var_1_13) [L102] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] EXPR (var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] EXPR (var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] var_1_14 = __VERIFIER_nondet_double() [L104] EXPR \read(var_1_14) [L104] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F [L104] EXPR \read(var_1_14) [L104] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] var_1_18 = __VERIFIER_nondet_char() [L106] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L121] RET updateVariables() [L122] CALL step() [L56] COND FALSE !(! last_1_var_1_5) [L59] EXPR \read(*var_1_4_Pointer) [L59] (*(var_1_1_Pointer)) = (*(var_1_4_Pointer)) [L61] EXPR \read(*var_1_6_Pointer) [L61] unsigned char stepLocal_0 = (*(var_1_6_Pointer)); [L62] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] COND FALSE !((*(var_1_2_Pointer))) [L71] EXPR \read(*var_1_1_Pointer) [L71] (*(var_1_15_Pointer)) = (*(var_1_1_Pointer)) [L72] EXPR \read(*var_1_13_Pointer) [L72] (*(var_1_16_Pointer)) = (*(var_1_13_Pointer)) [L73] EXPR \read(*var_1_18_Pointer) [L73] (*(var_1_17_Pointer)) = (*(var_1_18_Pointer)) [L74] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] EXPR (((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) [L74] EXPR \read(*var_1_15_Pointer) [L74] EXPR (((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=257, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] COND FALSE !((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) > (*(var_1_15_Pointer))) [L122] RET step() [L123] CALL, EXPR property() [L113] EXPR (! last_1_var_1_5) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) [L113] EXPR \read(*var_1_1_Pointer) [L113] EXPR \read(*var_1_4_Pointer) [L113] EXPR (! last_1_var_1_5) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] EXPR ((! last_1_var_1_5) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer))))) && ((*(var_1_2_Pointer)) ? (((*(var_1_6_Pointer)) && (((*(var_1_3_Pointer)) >= 16) || last_1_var_1_5)) ? ((*(var_1_6_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_9_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) : 1) : 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] EXPR ((! last_1_var_1_5) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer))))) && ((*(var_1_2_Pointer)) ? (((*(var_1_6_Pointer)) && (((*(var_1_3_Pointer)) >= 16) || last_1_var_1_5)) ? ((*(var_1_6_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_9_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) : 1) : 1) [L113] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] EXPR (*(var_1_2_Pointer)) ? (((*(var_1_6_Pointer)) && (((*(var_1_3_Pointer)) >= 16) || last_1_var_1_5)) ? ((*(var_1_6_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_9_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) : 1) : 1 [L113] EXPR (*(var_1_2_Pointer)) ? (((*(var_1_6_Pointer)) && (((*(var_1_3_Pointer)) >= 16) || last_1_var_1_5)) ? ((*(var_1_6_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_9_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) : 1) : 1 VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] EXPR ((! last_1_var_1_5) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer))))) && ((*(var_1_2_Pointer)) ? (((*(var_1_6_Pointer)) && (((*(var_1_3_Pointer)) >= 16) || last_1_var_1_5)) ? ((*(var_1_6_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_9_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) : 1) : 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] EXPR (((! last_1_var_1_5) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer))))) && ((*(var_1_2_Pointer)) ? (((*(var_1_6_Pointer)) && (((*(var_1_3_Pointer)) >= 16) || last_1_var_1_5)) ? ((*(var_1_6_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_9_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) : 1) : 1)) && (((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) > (*(var_1_15_Pointer))) ? ((((*(var_1_15_Pointer)) / -5) >= (((*(var_1_4_Pointer)) + (*(var_1_15_Pointer))) - (((((*(var_1_1_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_14_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] EXPR (((! last_1_var_1_5) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer))))) && ((*(var_1_2_Pointer)) ? (((*(var_1_6_Pointer)) && (((*(var_1_3_Pointer)) >= 16) || last_1_var_1_5)) ? ((*(var_1_6_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_9_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) : 1) : 1)) && (((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) > (*(var_1_15_Pointer))) ? ((((*(var_1_15_Pointer)) / -5) >= (((*(var_1_4_Pointer)) + (*(var_1_15_Pointer))) - (((((*(var_1_1_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_14_Pointer))))) : 1) [L113] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] EXPR (((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) [L113] EXPR \read(*var_1_15_Pointer) [L113] EXPR (((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] EXPR ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) > (*(var_1_15_Pointer))) ? ((((*(var_1_15_Pointer)) / -5) >= (((*(var_1_4_Pointer)) + (*(var_1_15_Pointer))) - (((((*(var_1_1_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_14_Pointer))))) : 1 [L113] EXPR ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) > (*(var_1_15_Pointer))) ? ((((*(var_1_15_Pointer)) / -5) >= (((*(var_1_4_Pointer)) + (*(var_1_15_Pointer))) - (((((*(var_1_1_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_14_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] EXPR (((! last_1_var_1_5) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer))))) && ((*(var_1_2_Pointer)) ? (((*(var_1_6_Pointer)) && (((*(var_1_3_Pointer)) >= 16) || last_1_var_1_5)) ? ((*(var_1_6_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_9_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) : 1) : 1)) && (((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) > (*(var_1_15_Pointer))) ? ((((*(var_1_15_Pointer)) / -5) >= (((*(var_1_4_Pointer)) + (*(var_1_15_Pointer))) - (((((*(var_1_1_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_14_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] EXPR ((((! last_1_var_1_5) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer))))) && ((*(var_1_2_Pointer)) ? (((*(var_1_6_Pointer)) && (((*(var_1_3_Pointer)) >= 16) || last_1_var_1_5)) ? ((*(var_1_6_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_9_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) : 1) : 1)) && (((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) > (*(var_1_15_Pointer))) ? ((((*(var_1_15_Pointer)) / -5) >= (((*(var_1_4_Pointer)) + (*(var_1_15_Pointer))) - (((((*(var_1_1_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] EXPR ((((! last_1_var_1_5) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer))))) && ((*(var_1_2_Pointer)) ? (((*(var_1_6_Pointer)) && (((*(var_1_3_Pointer)) >= 16) || last_1_var_1_5)) ? ((*(var_1_6_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_9_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) : 1) : 1)) && (((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) > (*(var_1_15_Pointer))) ? ((((*(var_1_15_Pointer)) / -5) >= (((*(var_1_4_Pointer)) + (*(var_1_15_Pointer))) - (((((*(var_1_1_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) [L113] EXPR \read(*var_1_15_Pointer) [L113] EXPR \read(*var_1_1_Pointer) [L113] EXPR ((((! last_1_var_1_5) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer))))) && ((*(var_1_2_Pointer)) ? (((*(var_1_6_Pointer)) && (((*(var_1_3_Pointer)) >= 16) || last_1_var_1_5)) ? ((*(var_1_6_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_9_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) : 1) : 1)) && (((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) > (*(var_1_15_Pointer))) ? ((((*(var_1_15_Pointer)) / -5) >= (((*(var_1_4_Pointer)) + (*(var_1_15_Pointer))) - (((((*(var_1_1_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] EXPR (((((! last_1_var_1_5) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer))))) && ((*(var_1_2_Pointer)) ? (((*(var_1_6_Pointer)) && (((*(var_1_3_Pointer)) >= 16) || last_1_var_1_5)) ? ((*(var_1_6_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_9_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) : 1) : 1)) && (((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) > (*(var_1_15_Pointer))) ? ((((*(var_1_15_Pointer)) / -5) >= (((*(var_1_4_Pointer)) + (*(var_1_15_Pointer))) - (((((*(var_1_1_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_13_Pointer)))) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] EXPR (((((! last_1_var_1_5) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer))))) && ((*(var_1_2_Pointer)) ? (((*(var_1_6_Pointer)) && (((*(var_1_3_Pointer)) >= 16) || last_1_var_1_5)) ? ((*(var_1_6_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_9_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) : 1) : 1)) && (((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) > (*(var_1_15_Pointer))) ? ((((*(var_1_15_Pointer)) / -5) >= (((*(var_1_4_Pointer)) + (*(var_1_15_Pointer))) - (((((*(var_1_1_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_13_Pointer)))) [L113] EXPR \read(*var_1_16_Pointer) [L113] EXPR \read(*var_1_13_Pointer) [L113] EXPR (((((! last_1_var_1_5) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer))))) && ((*(var_1_2_Pointer)) ? (((*(var_1_6_Pointer)) && (((*(var_1_3_Pointer)) >= 16) || last_1_var_1_5)) ? ((*(var_1_6_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_9_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) : 1) : 1)) && (((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) > (*(var_1_15_Pointer))) ? ((((*(var_1_15_Pointer)) / -5) >= (((*(var_1_4_Pointer)) + (*(var_1_15_Pointer))) - (((((*(var_1_1_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_13_Pointer)))) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] EXPR ((((((! last_1_var_1_5) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer))))) && ((*(var_1_2_Pointer)) ? (((*(var_1_6_Pointer)) && (((*(var_1_3_Pointer)) >= 16) || last_1_var_1_5)) ? ((*(var_1_6_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_9_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) : 1) : 1)) && (((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) > (*(var_1_15_Pointer))) ? ((((*(var_1_15_Pointer)) / -5) >= (((*(var_1_4_Pointer)) + (*(var_1_15_Pointer))) - (((((*(var_1_1_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_13_Pointer))))) && ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] EXPR ((((((! last_1_var_1_5) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer))))) && ((*(var_1_2_Pointer)) ? (((*(var_1_6_Pointer)) && (((*(var_1_3_Pointer)) >= 16) || last_1_var_1_5)) ? ((*(var_1_6_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_9_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) : 1) : 1)) && (((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) > (*(var_1_15_Pointer))) ? ((((*(var_1_15_Pointer)) / -5) >= (((*(var_1_4_Pointer)) + (*(var_1_15_Pointer))) - (((((*(var_1_1_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_13_Pointer))))) && ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113-L114] return ((((((! last_1_var_1_5) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_3_Pointer))) < ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer))))) && ((*(var_1_2_Pointer)) ? (((*(var_1_6_Pointer)) && (((*(var_1_3_Pointer)) >= 16) || last_1_var_1_5)) ? ((*(var_1_6_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_9_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) : 1) : 1)) && (((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) > (*(var_1_15_Pointer))) ? ((((*(var_1_15_Pointer)) / -5) >= (((*(var_1_4_Pointer)) + (*(var_1_15_Pointer))) - (((((*(var_1_1_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : ((*(var_1_11_Pointer)) == ((double) (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_13_Pointer))))) && ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_18_Pointer)))) ; [L123] RET, EXPR property() [L123] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 173 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 15, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 943 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 943 mSDsluCounter, 7192 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4907 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 504 IncrementalHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 2285 mSDtfsCounter, 504 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 484 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred in iteration=14, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 127 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2403 NumberOfCodeBlocks, 2403 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2249 ConstructedInterpolants, 0 QuantifiedInterpolants, 3384 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1780 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 8040/8160 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-08 16:46:10,467 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-96.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 a853c07cdb9387b63b93be13a2dc9697d60053474c0652611eb00fce1c18c0e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:46:12,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:46:12,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:46:12,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:46:12,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:46:12,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:46:12,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:46:12,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:46:12,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:46:12,347 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:46:12,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:46:12,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:46:12,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:46:12,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:46:12,348 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:46:12,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:46:12,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:46:12,348 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:46:12,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:46:12,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:46:12,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:46:12,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:46:12,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:46:12,348 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:46:12,348 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:46:12,348 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:46:12,348 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:46:12,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:46:12,349 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:46:12,349 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:46:12,349 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:46:12,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:46:12,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:46:12,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:46:12,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:46:12,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:46:12,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:46:12,349 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:46:12,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:46:12,349 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:46:12,349 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:46:12,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:46:12,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:46:12,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:46:12,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:46:12,350 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 -> a853c07cdb9387b63b93be13a2dc9697d60053474c0652611eb00fce1c18c0e9 [2025-03-08 16:46:12,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:46:12,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:46:12,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:46:12,597 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:46:12,599 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:46:12,599 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-96.i [2025-03-08 16:46:13,764 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b893633a/32b7465c6d5f4dd599e4056e15a7fa70/FLAG3be3746b0 [2025-03-08 16:46:13,916 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:46:13,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-96.i [2025-03-08 16:46:13,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b893633a/32b7465c6d5f4dd599e4056e15a7fa70/FLAG3be3746b0 [2025-03-08 16:46:14,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b893633a/32b7465c6d5f4dd599e4056e15a7fa70 [2025-03-08 16:46:14,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:46:14,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:46:14,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:46:14,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:46:14,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:46:14,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:46:14" (1/1) ... [2025-03-08 16:46:14,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a437223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:14, skipping insertion in model container [2025-03-08 16:46:14,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:46:14" (1/1) ... [2025-03-08 16:46:14,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:46:14,424 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-96.i[916,929] [2025-03-08 16:46:14,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:46:14,477 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:46:14,484 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-96.i[916,929] [2025-03-08 16:46:14,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:46:14,521 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:46:14,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:14 WrapperNode [2025-03-08 16:46:14,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:46:14,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:46:14,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:46:14,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:46:14,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:14" (1/1) ... [2025-03-08 16:46:14,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:14" (1/1) ... [2025-03-08 16:46:14,560 INFO L138 Inliner]: procedures = 39, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 516 [2025-03-08 16:46:14,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:46:14,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:46:14,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:46:14,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:46:14,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:14" (1/1) ... [2025-03-08 16:46:14,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:14" (1/1) ... [2025-03-08 16:46:14,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:14" (1/1) ... [2025-03-08 16:46:14,594 INFO L175 MemorySlicer]: Split 127 memory accesses to 16 slices as follows [2, 15, 6, 14, 12, 6, 8, 6, 6, 5, 10, 10, 15, 3, 3, 6]. 12 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2025-03-08 16:46:14,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:14" (1/1) ... [2025-03-08 16:46:14,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:14" (1/1) ... [2025-03-08 16:46:14,618 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:14" (1/1) ... [2025-03-08 16:46:14,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:14" (1/1) ... [2025-03-08 16:46:14,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:14" (1/1) ... [2025-03-08 16:46:14,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:14" (1/1) ... [2025-03-08 16:46:14,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:46:14,648 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:46:14,648 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:46:14,648 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:46:14,651 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:14" (1/1) ... [2025-03-08 16:46:14,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:46:14,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:46:14,679 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-08 16:46:14,685 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-08 16:46:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#15 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-03-08 16:46:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#15 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-08 16:46:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-08 16:46:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-08 16:46:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-08 16:46:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-08 16:46:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-08 16:46:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-03-08 16:46:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-03-08 16:46:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-03-08 16:46:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-03-08 16:46:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-03-08 16:46:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-03-08 16:46:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2025-03-08 16:46:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2025-03-08 16:46:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:46:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:46:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 16:46:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-08 16:46:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-08 16:46:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-08 16:46:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#15 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-08 16:46:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-08 16:46:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-03-08 16:46:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-03-08 16:46:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-03-08 16:46:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-03-08 16:46:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2025-03-08 16:46:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2025-03-08 16:46:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-08 16:46:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-08 16:46:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-08 16:46:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-08 16:46:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-08 16:46:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-08 16:46:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-08 16:46:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-03-08 16:46:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-03-08 16:46:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2025-03-08 16:46:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2025-03-08 16:46:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:46:14,712 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:46:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:46:14,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:46:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:46:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:46:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-08 16:46:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-08 16:46:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-08 16:46:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-08 16:46:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-08 16:46:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-08 16:46:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-08 16:46:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-08 16:46:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-08 16:46:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-08 16:46:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-03-08 16:46:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-03-08 16:46:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2025-03-08 16:46:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2025-03-08 16:46:15,021 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:46:15,022 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:46:15,836 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: havoc property_#t~ite85#1;havoc property_#t~mem82#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem86#1;havoc property_#t~ite100#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short89#1;havoc property_#t~ite99#1;havoc property_#t~mem90#1;havoc property_#t~ite98#1;havoc property_#t~mem95#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~short94#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~ite105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~ite121#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite120#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short122#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~short125#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~short128#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short131#1; [2025-03-08 16:46:15,884 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2025-03-08 16:46:15,885 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:46:15,893 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:46:15,893 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:46:15,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:46:15 BoogieIcfgContainer [2025-03-08 16:46:15,893 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:46:15,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:46:15,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:46:15,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:46:15,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:46:14" (1/3) ... [2025-03-08 16:46:15,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4168aee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:46:15, skipping insertion in model container [2025-03-08 16:46:15,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:14" (2/3) ... [2025-03-08 16:46:15,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4168aee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:46:15, skipping insertion in model container [2025-03-08 16:46:15,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:46:15" (3/3) ... [2025-03-08 16:46:15,904 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-96.i [2025-03-08 16:46:15,915 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:46:15,916 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-96.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:46:15,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:46:15,964 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;@4b19d41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:46:15,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:46:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 89 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:46:15,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:46:15,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:15,975 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:15,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:15,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:15,981 INFO L85 PathProgramCache]: Analyzing trace with hash -988562694, now seen corresponding path program 1 times [2025-03-08 16:46:15,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:46:15,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690428618] [2025-03-08 16:46:15,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:15,989 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-08 16:46:15,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:46:15,995 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-08 16:46:15,997 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-08 16:46:16,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:46:16,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:46:16,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:16,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:16,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:46:16,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:46:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-03-08 16:46:16,435 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:46:16,436 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:46:16,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690428618] [2025-03-08 16:46:16,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690428618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:16,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:16,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:46:16,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520847018] [2025-03-08 16:46:16,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:16,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:46:16,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:46:16,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:46:16,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:46:16,460 INFO L87 Difference]: Start difference. First operand has 107 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 89 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:46:16,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:16,485 INFO L93 Difference]: Finished difference Result 208 states and 325 transitions. [2025-03-08 16:46:16,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:46:16,486 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2025-03-08 16:46:16,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:16,490 INFO L225 Difference]: With dead ends: 208 [2025-03-08 16:46:16,490 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 16:46:16,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-08 16:46:16,494 INFO L435 NwaCegarLoop]: 152 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, 152 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-08 16:46:16,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:46:16,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 16:46:16,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-08 16:46:16,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:46:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2025-03-08 16:46:16,526 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 131 [2025-03-08 16:46:16,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:16,527 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2025-03-08 16:46:16,527 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:46:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2025-03-08 16:46:16,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:46:16,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:16,530 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:16,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 16:46:16,735 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-08 16:46:16,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:16,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:16,736 INFO L85 PathProgramCache]: Analyzing trace with hash -904630196, now seen corresponding path program 1 times [2025-03-08 16:46:16,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:46:16,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393509813] [2025-03-08 16:46:16,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:16,736 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-08 16:46:16,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:46:16,740 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-08 16:46:16,742 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-08 16:46:16,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:46:17,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:46:17,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:17,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:17,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:46:17,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:46:17,171 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 9 treesize of output 5 [2025-03-08 16:46:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:17,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:46:17,194 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:46:17,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393509813] [2025-03-08 16:46:17,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393509813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:17,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:17,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:46:17,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13270310] [2025-03-08 16:46:17,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:17,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:46:17,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:46:17,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:46:17,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:46:17,196 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:17,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:17,237 INFO L93 Difference]: Finished difference Result 205 states and 301 transitions. [2025-03-08 16:46:17,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:46:17,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-03-08 16:46:17,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:17,239 INFO L225 Difference]: With dead ends: 205 [2025-03-08 16:46:17,239 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 16:46:17,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:46:17,240 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:17,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:46:17,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 16:46:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-08 16:46:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:46:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2025-03-08 16:46:17,255 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 131 [2025-03-08 16:46:17,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:17,257 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2025-03-08 16:46:17,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2025-03-08 16:46:17,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:46:17,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:17,262 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:17,272 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-08 16:46:17,463 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-08 16:46:17,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:17,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:17,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1749102067, now seen corresponding path program 1 times [2025-03-08 16:46:17,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:46:17,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159243044] [2025-03-08 16:46:17,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:17,464 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-08 16:46:17,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:46:17,466 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-08 16:46:17,467 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-08 16:46:17,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:46:17,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:46:17,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:17,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:17,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:46:17,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:46:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:17,833 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:46:17,833 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:46:17,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159243044] [2025-03-08 16:46:17,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159243044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:17,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:17,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:46:17,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044908032] [2025-03-08 16:46:17,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:17,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:46:17,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:46:17,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:46:17,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:46:17,838 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:17,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:17,904 INFO L93 Difference]: Finished difference Result 210 states and 306 transitions. [2025-03-08 16:46:17,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:46:17,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-03-08 16:46:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:17,906 INFO L225 Difference]: With dead ends: 210 [2025-03-08 16:46:17,906 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 16:46:17,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 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-08 16:46:17,907 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 568 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-08 16:46:17,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 568 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:46:17,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 16:46:17,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-03-08 16:46:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:46:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2025-03-08 16:46:17,919 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 131 [2025-03-08 16:46:17,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:17,922 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2025-03-08 16:46:17,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:17,922 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2025-03-08 16:46:17,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:46:17,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:17,927 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:17,936 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-08 16:46:18,127 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-08 16:46:18,128 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:18,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:18,128 INFO L85 PathProgramCache]: Analyzing trace with hash 738410766, now seen corresponding path program 1 times [2025-03-08 16:46:18,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:46:18,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133535373] [2025-03-08 16:46:18,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:18,129 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-08 16:46:18,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:46:18,131 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-08 16:46:18,133 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-08 16:46:18,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:46:18,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:46:18,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:18,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:18,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:46:18,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:46:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:18,520 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:46:18,520 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:46:18,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133535373] [2025-03-08 16:46:18,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133535373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:18,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:18,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:46:18,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568013545] [2025-03-08 16:46:18,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:18,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:46:18,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:46:18,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:46:18,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:46:18,521 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:18,732 INFO L93 Difference]: Finished difference Result 216 states and 311 transitions. [2025-03-08 16:46:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:46:18,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-03-08 16:46:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:18,736 INFO L225 Difference]: With dead ends: 216 [2025-03-08 16:46:18,737 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 16:46:18,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 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-08 16:46:18,738 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 700 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:18,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 700 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:46:18,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 16:46:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-03-08 16:46:18,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.358695652173913) internal successors, (125), 92 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:46:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 157 transitions. [2025-03-08 16:46:18,753 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 157 transitions. Word has length 131 [2025-03-08 16:46:18,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:18,754 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 157 transitions. [2025-03-08 16:46:18,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 157 transitions. [2025-03-08 16:46:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:46:18,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:18,755 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:18,764 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-08 16:46:18,955 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-08 16:46:18,956 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:18,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:18,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1625914447, now seen corresponding path program 1 times [2025-03-08 16:46:18,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:46:18,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973321754] [2025-03-08 16:46:18,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:18,957 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-08 16:46:18,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:46:18,958 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-08 16:46:18,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 16:46:19,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:46:19,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:46:19,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:19,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:19,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:46:19,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:46:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:19,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:46:19,295 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:46:19,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973321754] [2025-03-08 16:46:19,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973321754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:19,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:19,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:46:19,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829475215] [2025-03-08 16:46:19,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:19,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:46:19,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:46:19,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:46:19,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:46:19,297 INFO L87 Difference]: Start difference. First operand 110 states and 157 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:19,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:19,499 INFO L93 Difference]: Finished difference Result 220 states and 315 transitions. [2025-03-08 16:46:19,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:46:19,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-03-08 16:46:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:19,500 INFO L225 Difference]: With dead ends: 220 [2025-03-08 16:46:19,500 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 16:46:19,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 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-08 16:46:19,501 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 833 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:19,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 833 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:46:19,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 16:46:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-03-08 16:46:19,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.351063829787234) internal successors, (127), 94 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:46:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 159 transitions. [2025-03-08 16:46:19,507 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 159 transitions. Word has length 131 [2025-03-08 16:46:19,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:19,507 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 159 transitions. [2025-03-08 16:46:19,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:19,507 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 159 transitions. [2025-03-08 16:46:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:46:19,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:19,508 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:19,516 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-08 16:46:19,712 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-08 16:46:19,712 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:19,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:19,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1626837968, now seen corresponding path program 1 times [2025-03-08 16:46:19,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:46:19,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949866728] [2025-03-08 16:46:19,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:19,713 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-08 16:46:19,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:46:19,715 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-08 16:46:19,716 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-08 16:46:19,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:46:19,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:46:19,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:19,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:19,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 16:46:19,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:46:20,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-08 16:46:20,257 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 54 treesize of output 42 [2025-03-08 16:46:20,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-08 16:46:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-08 16:46:20,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:46:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:20,405 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:46:20,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949866728] [2025-03-08 16:46:20,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949866728] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:46:20,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:46:20,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-08 16:46:20,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945976748] [2025-03-08 16:46:20,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:20,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:46:20,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:46:20,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:46:20,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:46:20,407 INFO L87 Difference]: Start difference. First operand 112 states and 159 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:20,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:20,687 INFO L93 Difference]: Finished difference Result 294 states and 416 transitions. [2025-03-08 16:46:20,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:46:20,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-03-08 16:46:20,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:20,688 INFO L225 Difference]: With dead ends: 294 [2025-03-08 16:46:20,689 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 16:46:20,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:46:20,689 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 84 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:20,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 624 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:46:20,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 16:46:20,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2025-03-08 16:46:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 160 states have internal predecessors, (217), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:46:20,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 257 transitions. [2025-03-08 16:46:20,697 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 257 transitions. Word has length 131 [2025-03-08 16:46:20,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:20,697 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 257 transitions. [2025-03-08 16:46:20,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:20,697 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 257 transitions. [2025-03-08 16:46:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:46:20,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:20,698 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:20,706 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-08 16:46:20,898 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-08 16:46:20,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:20,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:20,899 INFO L85 PathProgramCache]: Analyzing trace with hash -466842354, now seen corresponding path program 1 times [2025-03-08 16:46:20,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:46:20,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140190437] [2025-03-08 16:46:20,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:20,900 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-08 16:46:20,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:46:20,901 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-08 16:46:20,902 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-08 16:46:21,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:46:21,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:46:21,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:21,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:21,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:46:21,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:46:21,175 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 17 treesize of output 9 [2025-03-08 16:46:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:21,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:46:21,326 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:46:21,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140190437] [2025-03-08 16:46:21,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140190437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:21,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:21,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:46:21,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021301292] [2025-03-08 16:46:21,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:21,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:46:21,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:46:21,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:46:21,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:46:21,328 INFO L87 Difference]: Start difference. First operand 182 states and 257 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:21,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:21,438 INFO L93 Difference]: Finished difference Result 524 states and 738 transitions. [2025-03-08 16:46:21,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:46:21,439 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-03-08 16:46:21,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:21,441 INFO L225 Difference]: With dead ends: 524 [2025-03-08 16:46:21,442 INFO L226 Difference]: Without dead ends: 345 [2025-03-08 16:46:21,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:46:21,442 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 242 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:21,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 424 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:46:21,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-08 16:46:21,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 304. [2025-03-08 16:46:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 259 states have (on average 1.3436293436293436) internal successors, (348), 261 states have internal predecessors, (348), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 16:46:21,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 428 transitions. [2025-03-08 16:46:21,467 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 428 transitions. Word has length 133 [2025-03-08 16:46:21,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:21,468 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 428 transitions. [2025-03-08 16:46:21,468 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:21,468 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 428 transitions. [2025-03-08 16:46:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:46:21,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:21,469 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:21,478 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-08 16:46:21,669 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-08 16:46:21,669 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:21,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:21,670 INFO L85 PathProgramCache]: Analyzing trace with hash -464681566, now seen corresponding path program 1 times [2025-03-08 16:46:21,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:46:21,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482071437] [2025-03-08 16:46:21,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:21,670 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-08 16:46:21,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:46:21,672 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-08 16:46:21,673 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-08 16:46:21,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:46:21,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:46:21,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:21,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:21,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:46:21,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:46:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:21,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:46:21,974 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:46:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482071437] [2025-03-08 16:46:21,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482071437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:21,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:21,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:46:21,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783231243] [2025-03-08 16:46:21,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:21,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:46:21,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:46:21,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:46:21,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:46:21,975 INFO L87 Difference]: Start difference. First operand 304 states and 428 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:22,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:22,009 INFO L93 Difference]: Finished difference Result 605 states and 852 transitions. [2025-03-08 16:46:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:46:22,010 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-03-08 16:46:22,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:22,012 INFO L225 Difference]: With dead ends: 605 [2025-03-08 16:46:22,012 INFO L226 Difference]: Without dead ends: 313 [2025-03-08 16:46:22,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 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-08 16:46:22,013 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:22,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:46:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-08 16:46:22,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2025-03-08 16:46:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 268 states have (on average 1.3320895522388059) internal successors, (357), 270 states have internal predecessors, (357), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 16:46:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 437 transitions. [2025-03-08 16:46:22,028 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 437 transitions. Word has length 133 [2025-03-08 16:46:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:22,028 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 437 transitions. [2025-03-08 16:46:22,028 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 437 transitions. [2025-03-08 16:46:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:46:22,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:22,030 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:22,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2025-03-08 16:46:22,230 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-08 16:46:22,230 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:22,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:22,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1526071981, now seen corresponding path program 1 times [2025-03-08 16:46:22,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:46:22,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164023864] [2025-03-08 16:46:22,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:22,231 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-08 16:46:22,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:46:22,233 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-08 16:46:22,234 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-08 16:46:22,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:46:22,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:46:22,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:22,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:22,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 16:46:22,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:46:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 14 proven. 102 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:46:22,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:46:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:22,919 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:46:22,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164023864] [2025-03-08 16:46:22,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164023864] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:46:22,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:46:22,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-08 16:46:22,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500160023] [2025-03-08 16:46:22,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:22,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:46:22,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:46:22,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:46:22,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:46:22,920 INFO L87 Difference]: Start difference. First operand 313 states and 437 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:22,983 INFO L93 Difference]: Finished difference Result 741 states and 1026 transitions. [2025-03-08 16:46:22,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:46:22,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-03-08 16:46:22,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:22,986 INFO L225 Difference]: With dead ends: 741 [2025-03-08 16:46:22,986 INFO L226 Difference]: Without dead ends: 440 [2025-03-08 16:46:22,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:46:22,987 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 90 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:22,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 430 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:46:22,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-08 16:46:23,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 352. [2025-03-08 16:46:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 307 states have (on average 1.3387622149837133) internal successors, (411), 309 states have internal predecessors, (411), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 16:46:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 491 transitions. [2025-03-08 16:46:23,003 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 491 transitions. Word has length 136 [2025-03-08 16:46:23,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:23,004 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 491 transitions. [2025-03-08 16:46:23,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 491 transitions. [2025-03-08 16:46:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 16:46:23,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:23,005 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:23,013 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-08 16:46:23,205 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-08 16:46:23,206 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:23,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:23,206 INFO L85 PathProgramCache]: Analyzing trace with hash -425290794, now seen corresponding path program 1 times [2025-03-08 16:46:23,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:46:23,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627314908] [2025-03-08 16:46:23,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:23,207 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-08 16:46:23,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:46:23,208 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-08 16:46:23,209 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-08 16:46:23,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:46:23,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:46:23,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:23,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:23,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:46:23,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:46:23,512 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 17 treesize of output 13 [2025-03-08 16:46:23,514 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 13 treesize of output 9 [2025-03-08 16:46:23,575 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 17 treesize of output 9 [2025-03-08 16:46:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:23,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:46:23,585 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:46:23,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627314908] [2025-03-08 16:46:23,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627314908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:46:23,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:46:23,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:46:23,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698709456] [2025-03-08 16:46:23,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:23,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:46:23,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:46:23,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:46:23,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:46:23,587 INFO L87 Difference]: Start difference. First operand 352 states and 491 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:23,753 INFO L93 Difference]: Finished difference Result 743 states and 1039 transitions. [2025-03-08 16:46:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:46:23,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2025-03-08 16:46:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:23,760 INFO L225 Difference]: With dead ends: 743 [2025-03-08 16:46:23,760 INFO L226 Difference]: Without dead ends: 403 [2025-03-08 16:46:23,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:46:23,761 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 136 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:23,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 532 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:46:23,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-08 16:46:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 390. [2025-03-08 16:46:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 332 states have (on average 1.322289156626506) internal successors, (439), 334 states have internal predecessors, (439), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:46:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 543 transitions. [2025-03-08 16:46:23,775 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 543 transitions. Word has length 137 [2025-03-08 16:46:23,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:23,777 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 543 transitions. [2025-03-08 16:46:23,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 543 transitions. [2025-03-08 16:46:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 16:46:23,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:23,779 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:23,787 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-08 16:46:23,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:46:23,979 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:23,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:23,980 INFO L85 PathProgramCache]: Analyzing trace with hash -930849419, now seen corresponding path program 1 times [2025-03-08 16:46:23,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:46:23,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396261850] [2025-03-08 16:46:23,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:23,980 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-08 16:46:23,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:46:23,983 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:46:23,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-08 16:46:24,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:46:24,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:46:24,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:24,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:24,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 16:46:24,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:46:24,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-08 16:46:24,694 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 51 treesize of output 39 [2025-03-08 16:46:24,696 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 39 treesize of output 27 [2025-03-08 16:46:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-03-08 16:46:24,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:46:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:46:24,856 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:46:24,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396261850] [2025-03-08 16:46:24,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396261850] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:46:24,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:46:24,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2025-03-08 16:46:24,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278649310] [2025-03-08 16:46:24,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:46:24,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:46:24,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:46:24,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:46:24,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:46:24,857 INFO L87 Difference]: Start difference. First operand 390 states and 543 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:46:24,958 INFO L93 Difference]: Finished difference Result 409 states and 562 transitions. [2025-03-08 16:46:24,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:46:24,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2025-03-08 16:46:24,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:46:24,961 INFO L225 Difference]: With dead ends: 409 [2025-03-08 16:46:24,961 INFO L226 Difference]: Without dead ends: 407 [2025-03-08 16:46:24,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:46:24,961 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 104 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:46:24,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 913 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:46:24,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-08 16:46:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2025-03-08 16:46:24,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 347 states have (on average 1.30835734870317) internal successors, (454), 349 states have internal predecessors, (454), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:46:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 558 transitions. [2025-03-08 16:46:24,984 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 558 transitions. Word has length 137 [2025-03-08 16:46:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:46:24,985 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 558 transitions. [2025-03-08 16:46:24,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:46:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 558 transitions. [2025-03-08 16:46:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 16:46:24,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:46:24,986 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:24,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-03-08 16:46:25,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:46:25,186 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:46:25,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:46:25,187 INFO L85 PathProgramCache]: Analyzing trace with hash -929925898, now seen corresponding path program 1 times [2025-03-08 16:46:25,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:46:25,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120465819] [2025-03-08 16:46:25,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:25,187 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-08 16:46:25,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:46:25,189 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-08 16:46:25,190 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-08 16:46:25,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:46:25,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:46:25,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:25,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:25,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 16:46:25,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:46:27,263 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-08 16:46:36,532 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 185 treesize of output 149 [2025-03-08 16:46:36,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:46:36,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 117 [2025-03-08 16:46:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 16:46:37,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:46:46,020 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:46:46,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120465819] [2025-03-08 16:46:46,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120465819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:46:46,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1293991496] [2025-03-08 16:46:46,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:46:46,020 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:46:46,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:46:46,022 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-08 16:46:46,023 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-08 16:46:46,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:46:46,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:46:46,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:46:46,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:46:47,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 16:46:47,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:46:48,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2025-03-08 16:46:50,850 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-08 16:47:08,726 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 185 treesize of output 149 [2025-03-08 16:47:08,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 121 [2025-03-08 16:47:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 16:47:09,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:47:18,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1293991496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:47:18,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:47:18,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-03-08 16:47:18,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509497190] [2025-03-08 16:47:18,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:47:18,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 16:47:18,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:47:18,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 16:47:18,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:47:18,987 INFO L87 Difference]: Start difference. First operand 407 states and 558 transitions. Second operand has 16 states, 16 states have (on average 7.5) internal successors, (120), 15 states have internal predecessors, (120), 4 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-08 16:47:36,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 16:47:39,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]