./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.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 7a1b99a13fe789fcacb85c536e70757eaddea3ef4c22e9aee449ecb3b551f3f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:27:21,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:27:21,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:27:21,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:27:21,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:27:21,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:27:21,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:27:21,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:27:21,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:27:21,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:27:21,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:27:21,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:27:21,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:27:21,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:27:21,409 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:27:21,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:27:21,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:27:21,409 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:27:21,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:27:21,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:27:21,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:27:21,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:27:21,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:27:21,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:27:21,410 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:27:21,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:27:21,410 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:27:21,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:27:21,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:27:21,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:27:21,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:27:21,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:27:21,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:27:21,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:27:21,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:27:21,411 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:27:21,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:27:21,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:27:21,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:27:21,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:27:21,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:27:21,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:27:21,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:27:21,412 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 -> 7a1b99a13fe789fcacb85c536e70757eaddea3ef4c22e9aee449ecb3b551f3f3 [2025-03-17 05:27:21,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:27:21,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:27:21,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:27:21,633 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:27:21,633 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:27:21,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i [2025-03-17 05:27:22,735 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ad8659fb/43f39bd5b22945f9970882ccdeaccc49/FLAG5c3423221 [2025-03-17 05:27:22,967 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:27:22,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i [2025-03-17 05:27:22,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ad8659fb/43f39bd5b22945f9970882ccdeaccc49/FLAG5c3423221 [2025-03-17 05:27:23,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ad8659fb/43f39bd5b22945f9970882ccdeaccc49 [2025-03-17 05:27:23,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:27:23,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:27:23,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:27:23,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:27:23,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:27:23,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:27:23" (1/1) ... [2025-03-17 05:27:23,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c34d99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:23, skipping insertion in model container [2025-03-17 05:27:23,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:27:23" (1/1) ... [2025-03-17 05:27:23,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:27:23,402 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-a_file-72.i[916,929] [2025-03-17 05:27:23,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:27:23,452 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:27:23,459 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-a_file-72.i[916,929] [2025-03-17 05:27:23,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:27:23,500 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:27:23,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:23 WrapperNode [2025-03-17 05:27:23,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:27:23,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:27:23,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:27:23,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:27:23,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:23" (1/1) ... [2025-03-17 05:27:23,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:23" (1/1) ... [2025-03-17 05:27:23,542 INFO L138 Inliner]: procedures = 29, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 541 [2025-03-17 05:27:23,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:27:23,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:27:23,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:27:23,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:27:23,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:23" (1/1) ... [2025-03-17 05:27:23,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:23" (1/1) ... [2025-03-17 05:27:23,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:23" (1/1) ... [2025-03-17 05:27:23,574 INFO L175 MemorySlicer]: Split 138 memory accesses to 7 slices as follows [2, 24, 67, 9, 30, 3, 3]. 49 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 4, 5, 1, 5, 1, 1]. The 18 writes are split as follows [0, 4, 6, 1, 5, 1, 1]. [2025-03-17 05:27:23,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:23" (1/1) ... [2025-03-17 05:27:23,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:23" (1/1) ... [2025-03-17 05:27:23,586 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:23" (1/1) ... [2025-03-17 05:27:23,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:23" (1/1) ... [2025-03-17 05:27:23,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:23" (1/1) ... [2025-03-17 05:27:23,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:23" (1/1) ... [2025-03-17 05:27:23,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:27:23,593 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:27:23,593 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:27:23,594 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:27:23,594 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:23" (1/1) ... [2025-03-17 05:27:23,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:27:23,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:27:23,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:27:23,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:27:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:27:23,635 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:27:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:27:23,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:27:23,746 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:27:23,748 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:27:24,136 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~mem101#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem100#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem102#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~short105#1;havoc property_#t~short107#1;havoc property_#t~mem110#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1;havoc property_#t~mem121#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite120#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem126#1;havoc property_#t~ite142#1;havoc property_#t~mem127#1;havoc property_#t~ite141#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem140#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~ite139#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~short143#1;havoc property_#t~mem145#1;havoc property_#t~mem144#1;havoc property_#t~short146#1;havoc property_#t~mem147#1;havoc property_#t~short148#1;havoc property_#t~mem149#1;havoc property_#t~short150#1; [2025-03-17 05:27:24,188 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2025-03-17 05:27:24,188 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:27:24,196 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:27:24,196 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:27:24,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:27:24 BoogieIcfgContainer [2025-03-17 05:27:24,196 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:27:24,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:27:24,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:27:24,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:27:24,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:27:23" (1/3) ... [2025-03-17 05:27:24,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238a12c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:27:24, skipping insertion in model container [2025-03-17 05:27:24,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:23" (2/3) ... [2025-03-17 05:27:24,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238a12c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:27:24, skipping insertion in model container [2025-03-17 05:27:24,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:27:24" (3/3) ... [2025-03-17 05:27:24,203 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-72.i [2025-03-17 05:27:24,211 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:27:24,213 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-72.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:27:24,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:27:24,261 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;@3da6b2ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:27:24,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:27:24,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 102 states have (on average 1.4313725490196079) internal successors, (146), 103 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:27:24,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:27:24,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:24,272 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:27:24,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:24,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:24,277 INFO L85 PathProgramCache]: Analyzing trace with hash 228303330, now seen corresponding path program 1 times [2025-03-17 05:27:24,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:24,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345523579] [2025-03-17 05:27:24,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:24,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:24,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:27:24,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:27:24,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:24,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:24,566 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 05:27:24,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:24,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345523579] [2025-03-17 05:27:24,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345523579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:27:24,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388159796] [2025-03-17 05:27:24,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:24,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:24,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:27:24,570 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:27:24,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:27:24,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:27:24,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:27:24,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:24,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:24,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:27:24,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 05:27:24,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:24,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388159796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:24,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:27:24,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:27:24,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747617856] [2025-03-17 05:27:24,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:24,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:27:24,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:24,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:27:24,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:27:24,812 INFO L87 Difference]: Start difference. First operand has 122 states, 102 states have (on average 1.4313725490196079) internal successors, (146), 103 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:27:24,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:24,831 INFO L93 Difference]: Finished difference Result 241 states and 375 transitions. [2025-03-17 05:27:24,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:27:24,833 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2025-03-17 05:27:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:24,836 INFO L225 Difference]: With dead ends: 241 [2025-03-17 05:27:24,837 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 05:27:24,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:27:24,841 INFO L435 NwaCegarLoop]: 176 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, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:24,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:27:24,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 05:27:24,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-17 05:27:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:27:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-03-17 05:27:24,868 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 145 [2025-03-17 05:27:24,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:24,870 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-03-17 05:27:24,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:27:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-03-17 05:27:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:27:24,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:24,873 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:27:24,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:27:25,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:27:25,077 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:25,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:25,077 INFO L85 PathProgramCache]: Analyzing trace with hash 618363567, now seen corresponding path program 1 times [2025-03-17 05:27:25,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:25,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279772464] [2025-03-17 05:27:25,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:25,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:25,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:27:25,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:27:25,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:25,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:27:25,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:25,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279772464] [2025-03-17 05:27:25,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279772464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:27:25,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240453224] [2025-03-17 05:27:25,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:25,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:25,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:27:25,481 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:27:25,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:27:25,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:27:25,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:27:25,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:25,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:25,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:27:25,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:25,704 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:27:25,705 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:25,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240453224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:25,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:27:25,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:27:25,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945386199] [2025-03-17 05:27:25,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:25,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:27:25,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:25,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:27:25,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:27:25,708 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:27:25,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:25,751 INFO L93 Difference]: Finished difference Result 242 states and 355 transitions. [2025-03-17 05:27:25,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:27:25,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2025-03-17 05:27:25,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:25,755 INFO L225 Difference]: With dead ends: 242 [2025-03-17 05:27:25,755 INFO L226 Difference]: Without dead ends: 123 [2025-03-17 05:27:25,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:27:25,756 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 1 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:25,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 508 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:27:25,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-17 05:27:25,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2025-03-17 05:27:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 103 states have internal predecessors, (144), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:27:25,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2025-03-17 05:27:25,767 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 145 [2025-03-17 05:27:25,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:25,769 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2025-03-17 05:27:25,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:27:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2025-03-17 05:27:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:27:25,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:25,771 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:27:25,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:27:25,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 05:27:25,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:25,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:25,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1189090896, now seen corresponding path program 1 times [2025-03-17 05:27:25,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:25,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413646804] [2025-03-17 05:27:25,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:25,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:25,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:27:26,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:27:26,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:26,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:27:26,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:26,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413646804] [2025-03-17 05:27:26,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413646804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:27:26,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395129080] [2025-03-17 05:27:26,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:26,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:26,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:27:26,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:27:26,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:27:26,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:27:26,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:27:26,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:26,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:26,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:27:26,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:27:26,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:26,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395129080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:26,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:27:26,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:27:26,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052406575] [2025-03-17 05:27:26,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:26,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:27:26,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:26,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:27:26,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:27:26,409 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:27:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:26,445 INFO L93 Difference]: Finished difference Result 246 states and 359 transitions. [2025-03-17 05:27:26,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:27:26,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2025-03-17 05:27:26,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:26,446 INFO L225 Difference]: With dead ends: 246 [2025-03-17 05:27:26,446 INFO L226 Difference]: Without dead ends: 125 [2025-03-17 05:27:26,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:27:26,447 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 1 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:26,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 509 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:27:26,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-17 05:27:26,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-03-17 05:27:26,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3904761904761904) internal successors, (146), 105 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:27:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 180 transitions. [2025-03-17 05:27:26,463 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 180 transitions. Word has length 145 [2025-03-17 05:27:26,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:26,464 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 180 transitions. [2025-03-17 05:27:26,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:27:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 180 transitions. [2025-03-17 05:27:26,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:27:26,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:26,467 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:27:26,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 05:27:26,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:26,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:26,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:26,669 INFO L85 PathProgramCache]: Analyzing trace with hash -301587215, now seen corresponding path program 1 times [2025-03-17 05:27:26,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:26,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111769377] [2025-03-17 05:27:26,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:26,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:26,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:27:26,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:27:26,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:26,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:27:26,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:26,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111769377] [2025-03-17 05:27:26,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111769377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:27:26,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934104990] [2025-03-17 05:27:26,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:26,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:26,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:27:26,873 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:27:26,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:27:27,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:27:27,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:27:27,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:27,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:27,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:27:27,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:27:27,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:27,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934104990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:27,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:27:27,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:27:27,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527138452] [2025-03-17 05:27:27,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:27,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:27:27,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:27,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:27:27,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:27:27,108 INFO L87 Difference]: Start difference. First operand 124 states and 180 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:27:27,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:27,129 INFO L93 Difference]: Finished difference Result 250 states and 363 transitions. [2025-03-17 05:27:27,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:27:27,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2025-03-17 05:27:27,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:27,131 INFO L225 Difference]: With dead ends: 250 [2025-03-17 05:27:27,132 INFO L226 Difference]: Without dead ends: 127 [2025-03-17 05:27:27,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:27:27,134 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 1 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:27,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 511 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:27:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-17 05:27:27,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-03-17 05:27:27,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 107 states have internal predecessors, (148), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:27:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2025-03-17 05:27:27,141 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 182 transitions. Word has length 145 [2025-03-17 05:27:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:27,142 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 182 transitions. [2025-03-17 05:27:27,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:27:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 182 transitions. [2025-03-17 05:27:27,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:27:27,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:27,144 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:27:27,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:27:27,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:27,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:27,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:27,348 INFO L85 PathProgramCache]: Analyzing trace with hash -300663694, now seen corresponding path program 1 times [2025-03-17 05:27:27,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:27,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144179840] [2025-03-17 05:27:27,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:27,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:27,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:27:27,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:27:27,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:27,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:27:27,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:27,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144179840] [2025-03-17 05:27:27,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144179840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:27:27,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956304509] [2025-03-17 05:27:27,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:27,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:27,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:27:27,493 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:27:27,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:27:27,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:27:27,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:27:27,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:27,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:27,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:27:27,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:27:27,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:27,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956304509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:27,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:27:27,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 05:27:27,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272062945] [2025-03-17 05:27:27,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:27,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:27:27,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:27,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:27:27,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:27:27,701 INFO L87 Difference]: Start difference. First operand 126 states and 182 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:27:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:27,720 INFO L93 Difference]: Finished difference Result 253 states and 366 transitions. [2025-03-17 05:27:27,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:27:27,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2025-03-17 05:27:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:27,722 INFO L225 Difference]: With dead ends: 253 [2025-03-17 05:27:27,722 INFO L226 Difference]: Without dead ends: 128 [2025-03-17 05:27:27,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:27:27,724 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:27,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:27:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-17 05:27:27,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-03-17 05:27:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 109 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:27:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 184 transitions. [2025-03-17 05:27:27,734 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 184 transitions. Word has length 145 [2025-03-17 05:27:27,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:27,734 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 184 transitions. [2025-03-17 05:27:27,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:27:27,735 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 184 transitions. [2025-03-17 05:27:27,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:27:27,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:27,736 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:27:27,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 05:27:27,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:27,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:27,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:27,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1607211753, now seen corresponding path program 1 times [2025-03-17 05:27:27,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:27,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980525562] [2025-03-17 05:27:27,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:27,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:27,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:27:28,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:27:28,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:28,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:27:28,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:28,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980525562] [2025-03-17 05:27:28,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980525562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:27:28,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652746982] [2025-03-17 05:27:28,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:28,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:28,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:27:28,572 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:27:28,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 05:27:28,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:27:28,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:27:28,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:28,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:28,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 05:27:28,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:28,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:27:28,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:27:29,024 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-17 05:27:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 78 proven. 45 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2025-03-17 05:27:29,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:27:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:27:29,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652746982] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:27:29,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:27:29,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-03-17 05:27:29,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644586842] [2025-03-17 05:27:29,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:27:29,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:27:29,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:29,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:27:29,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:27:29,285 INFO L87 Difference]: Start difference. First operand 128 states and 184 transitions. Second operand has 14 states, 11 states have (on average 9.727272727272727) internal successors, (107), 14 states have internal predecessors, (107), 7 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (50), 4 states have call predecessors, (50), 7 states have call successors, (50) [2025-03-17 05:27:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:29,562 INFO L93 Difference]: Finished difference Result 263 states and 374 transitions. [2025-03-17 05:27:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:27:29,562 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 9.727272727272727) internal successors, (107), 14 states have internal predecessors, (107), 7 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (50), 4 states have call predecessors, (50), 7 states have call successors, (50) Word has length 147 [2025-03-17 05:27:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:29,563 INFO L225 Difference]: With dead ends: 263 [2025-03-17 05:27:29,563 INFO L226 Difference]: Without dead ends: 136 [2025-03-17 05:27:29,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 287 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:27:29,566 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 348 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:29,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 894 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:27:29,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-17 05:27:29,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2025-03-17 05:27:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 112 states have (on average 1.3571428571428572) internal successors, (152), 112 states have internal predecessors, (152), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:27:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 186 transitions. [2025-03-17 05:27:29,581 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 186 transitions. Word has length 147 [2025-03-17 05:27:29,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:29,581 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 186 transitions. [2025-03-17 05:27:29,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 9.727272727272727) internal successors, (107), 14 states have internal predecessors, (107), 7 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (50), 4 states have call predecessors, (50), 7 states have call successors, (50) [2025-03-17 05:27:29,582 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 186 transitions. [2025-03-17 05:27:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:27:29,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:29,583 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:27:29,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 05:27:29,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:29,785 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:29,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:29,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1958011690, now seen corresponding path program 1 times [2025-03-17 05:27:29,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:29,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098011081] [2025-03-17 05:27:29,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:29,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:29,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:27:29,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:27:29,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:29,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:27:29,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:27:29,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:27:29,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:27:29,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:29,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:27:29,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:27:29,966 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:27:29,967 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:27:29,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:27:29,971 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:27:30,066 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:27:30,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:27:30 BoogieIcfgContainer [2025-03-17 05:27:30,068 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:27:30,068 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:27:30,068 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:27:30,068 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:27:30,069 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:27:24" (3/4) ... [2025-03-17 05:27:30,071 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:27:30,071 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:27:30,073 INFO L158 Benchmark]: Toolchain (without parser) took 6765.13ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 109.6MB in the beginning and 208.9MB in the end (delta: -99.4MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2025-03-17 05:27:30,073 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:27:30,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.01ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 94.4MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:27:30,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.29ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 90.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:27:30,074 INFO L158 Benchmark]: Boogie Preprocessor took 49.54ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 86.0MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:27:30,074 INFO L158 Benchmark]: IcfgBuilder took 603.65ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 51.4MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:27:30,074 INFO L158 Benchmark]: TraceAbstraction took 5869.78ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 51.4MB in the beginning and 209.0MB in the end (delta: -157.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:27:30,075 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 285.2MB. Free memory was 209.0MB in the beginning and 208.9MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:27:30,076 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.78ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.01ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 94.4MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.29ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 90.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.54ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 86.0MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 603.65ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 51.4MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5869.78ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 51.4MB in the beginning and 209.0MB in the end (delta: -157.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 285.2MB. Free memory was 209.0MB in the beginning and 208.9MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 1} }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L28-L30] float float_Array_0[1] = { 0.25 }; [L28-L30] float float_Array_0[1] = { 0.25 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 2 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 2 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 10000 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 10000 }; [L40] unsigned char last_1_BOOL_unsigned_char_Array_0_1__1_ = 1; [L41] double last_1_double_Array_0_2_ = 256.4; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L93] EXPR BOOL_unsigned_char_Array_0[1][1] [L93] last_1_BOOL_unsigned_char_Array_0_1__1_ = BOOL_unsigned_char_Array_0[1][1] [L94] EXPR double_Array_0[2] [L94] last_1_double_Array_0_2_ = double_Array_0[2] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] double_Array_0[1] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[1] [L74] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L74] EXPR double_Array_0[1] [L74] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] double_Array_0[3] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[3] [L76] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F [L76] EXPR double_Array_0[3] [L76] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] double_Array_0[4] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[4] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L78] EXPR double_Array_0[4] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] float_Array_0[0] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(float_Array_0[0] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(float_Array_0[0] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] signed_char_Array_0[4] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[4] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[4] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L105] RET updateVariables() [L106] CALL step() [L45] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0][0]) [L48] EXPR signed_char_Array_0[0] [L48] EXPR signed_char_Array_0[1] [L48] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] EXPR (((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4])) [L48] EXPR signed_char_Array_0[0] [L48] EXPR signed_char_Array_0[1] [L48] EXPR (((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] signed_char_Array_0[3] = (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4])))) [L49] EXPR double_Array_0[4] [L49] double_Array_0[0] = double_Array_0[4] [L50] signed_char_Array_0[2] = 1 [L51] unsigned_short_int_Array_0[0] = 10 [L52] EXPR double_Array_0[0] [L52] EXPR double_Array_0[0] [L52] EXPR float_Array_0[0] [L52] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] COND FALSE !((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) [L59] EXPR double_Array_0[0] [L59] EXPR double_Array_0[2] [L59] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] EXPR ((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]) [L59] EXPR double_Array_0[2] [L59] EXPR ((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] COND FALSE !(double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR double_Array_0[0] [L97] EXPR double_Array_0[2] [L97] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]) [L97] EXPR double_Array_0[2] [L97] EXPR ((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1 [L97] EXPR BOOL_unsigned_char_Array_0[1][1] [L97] EXPR BOOL_unsigned_char_Array_0[0][1] [L97] EXPR BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4]))) && (signed_char_Array_0[2] == ((signed char) 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4]))) && (signed_char_Array_0[2] == ((signed char) 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4]))) && (signed_char_Array_0[2] == ((signed char) 1))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) 10)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4]))) && (signed_char_Array_0[2] == ((signed char) 1))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) 10)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97-L98] return (((((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4]))) && (signed_char_Array_0[2] == ((signed char) 1))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) 10)) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 197 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 7, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 351 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 351 mSDsluCounter, 3109 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2099 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 398 IncrementalHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 1010 mSDtfsCounter, 398 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1062 GetRequests, 1014 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=6, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1891 NumberOfCodeBlocks, 1891 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1878 ConstructedInterpolants, 0 QuantifiedInterpolants, 3730 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3179 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 6713/7072 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:27:30,094 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-a_file-72.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 7a1b99a13fe789fcacb85c536e70757eaddea3ef4c22e9aee449ecb3b551f3f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:27:31,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:27:31,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:27:31,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:27:31,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:27:31,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:27:31,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:27:31,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:27:31,958 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:27:31,958 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:27:31,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:27:31,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:27:31,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:27:31,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:27:31,960 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:27:31,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:27:31,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:27:31,960 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:27:31,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:27:31,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:27:31,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:27:31,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:27:31,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:27:31,961 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:27:31,961 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:27:31,961 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:27:31,961 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:27:31,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:27:31,961 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:27:31,961 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:27:31,961 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:27:31,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:27:31,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:27:31,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:27:31,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:27:31,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:27:31,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:27:31,963 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:27:31,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:27:31,963 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:27:31,963 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:27:31,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:27:31,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:27:31,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:27:31,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:27:31,963 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 -> 7a1b99a13fe789fcacb85c536e70757eaddea3ef4c22e9aee449ecb3b551f3f3 [2025-03-17 05:27:32,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:27:32,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:27:32,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:27:32,206 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:27:32,207 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:27:32,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i [2025-03-17 05:27:33,373 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c1177117/34d6694efa0546668f80ea6eccbc4c09/FLAG6d3098870 [2025-03-17 05:27:33,565 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:27:33,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i [2025-03-17 05:27:33,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c1177117/34d6694efa0546668f80ea6eccbc4c09/FLAG6d3098870 [2025-03-17 05:27:33,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c1177117/34d6694efa0546668f80ea6eccbc4c09 [2025-03-17 05:27:33,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:27:33,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:27:33,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:27:33,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:27:33,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:27:33,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:27:33" (1/1) ... [2025-03-17 05:27:33,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d747508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:33, skipping insertion in model container [2025-03-17 05:27:33,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:27:33" (1/1) ... [2025-03-17 05:27:33,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:27:33,710 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-a_file-72.i[916,929] [2025-03-17 05:27:33,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:27:33,768 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:27:33,775 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-a_file-72.i[916,929] [2025-03-17 05:27:33,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:27:33,840 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:27:33,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:33 WrapperNode [2025-03-17 05:27:33,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:27:33,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:27:33,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:27:33,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:27:33,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:33" (1/1) ... [2025-03-17 05:27:33,863 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:33" (1/1) ... [2025-03-17 05:27:33,899 INFO L138 Inliner]: procedures = 39, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 538 [2025-03-17 05:27:33,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:27:33,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:27:33,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:27:33,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:27:33,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:33" (1/1) ... [2025-03-17 05:27:33,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:33" (1/1) ... [2025-03-17 05:27:33,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:33" (1/1) ... [2025-03-17 05:27:33,946 INFO L175 MemorySlicer]: Split 138 memory accesses to 7 slices as follows [2, 24, 67, 9, 30, 3, 3]. 49 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 4, 5, 1, 5, 1, 1]. The 18 writes are split as follows [0, 4, 6, 1, 5, 1, 1]. [2025-03-17 05:27:33,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:33" (1/1) ... [2025-03-17 05:27:33,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:33" (1/1) ... [2025-03-17 05:27:33,974 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:33" (1/1) ... [2025-03-17 05:27:33,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:33" (1/1) ... [2025-03-17 05:27:33,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:33" (1/1) ... [2025-03-17 05:27:33,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:33" (1/1) ... [2025-03-17 05:27:33,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:27:33,989 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:27:33,989 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:27:33,989 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:27:33,991 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:33" (1/1) ... [2025-03-17 05:27:33,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:27:34,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:27:34,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:27:34,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:27:34,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:27:34,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:27:34,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:27:34,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:27:34,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:27:34,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:27:34,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-17 05:27:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-17 05:27:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:27:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:27:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:27:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:27:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:27:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-17 05:27:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-17 05:27:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:27:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:27:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:27:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:27:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:27:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:27:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:27:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:27:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:27:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:27:34,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:27:34,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:27:34,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-17 05:27:34,044 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:27:34,044 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:27:34,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:27:34,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:27:34,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:27:34,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:27:34,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:27:34,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:27:34,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:27:34,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:27:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:27:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:27:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:27:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:27:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:27:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:27:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-17 05:27:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-17 05:27:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:27:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:27:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:27:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:27:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:27:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:27:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-17 05:27:34,200 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:27:34,202 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:28:03,063 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~mem101#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem100#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem102#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~short105#1;havoc property_#t~short107#1;havoc property_#t~mem110#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1;havoc property_#t~mem121#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite120#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem126#1;havoc property_#t~ite142#1;havoc property_#t~mem127#1;havoc property_#t~ite141#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem140#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~ite139#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~short143#1;havoc property_#t~mem145#1;havoc property_#t~mem144#1;havoc property_#t~short146#1;havoc property_#t~mem147#1;havoc property_#t~short148#1;havoc property_#t~mem149#1;havoc property_#t~short150#1; [2025-03-17 05:28:03,085 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2025-03-17 05:28:03,085 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:28:03,093 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:28:03,094 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:28:03,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:28:03 BoogieIcfgContainer [2025-03-17 05:28:03,094 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:28:03,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:28:03,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:28:03,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:28:03,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:27:33" (1/3) ... [2025-03-17 05:28:03,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c4425a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:28:03, skipping insertion in model container [2025-03-17 05:28:03,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:33" (2/3) ... [2025-03-17 05:28:03,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c4425a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:28:03, skipping insertion in model container [2025-03-17 05:28:03,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:28:03" (3/3) ... [2025-03-17 05:28:03,101 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-72.i [2025-03-17 05:28:03,110 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:28:03,111 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-72.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:28:03,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:28:03,161 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;@6ebfb6c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:28:03,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:28:03,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 102 states have (on average 1.4313725490196079) internal successors, (146), 103 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:28:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:28:03,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:03,171 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:28:03,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:03,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:03,174 INFO L85 PathProgramCache]: Analyzing trace with hash 228303330, now seen corresponding path program 1 times [2025-03-17 05:28:03,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:28:03,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330556493] [2025-03-17 05:28:03,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:03,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:28:03,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:28:03,185 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:28:03,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:28:03,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:28:04,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:28:04,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:04,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:04,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:28:04,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-17 05:28:04,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:28:04,468 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:28:04,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330556493] [2025-03-17 05:28:04,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330556493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:04,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:28:04,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:28:04,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122829391] [2025-03-17 05:28:04,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:04,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:28:04,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:28:04,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:28:04,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:28:04,489 INFO L87 Difference]: Start difference. First operand has 122 states, 102 states have (on average 1.4313725490196079) internal successors, (146), 103 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:28:04,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:04,507 INFO L93 Difference]: Finished difference Result 241 states and 375 transitions. [2025-03-17 05:28:04,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:28:04,511 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2025-03-17 05:28:04,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:04,516 INFO L225 Difference]: With dead ends: 241 [2025-03-17 05:28:04,517 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 05:28:04,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:28:04,523 INFO L435 NwaCegarLoop]: 176 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, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:28:04,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:28:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 05:28:04,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-17 05:28:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:28:04,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-03-17 05:28:04,557 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 145 [2025-03-17 05:28:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:04,558 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-03-17 05:28:04,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:28:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-03-17 05:28:04,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:28:04,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:04,562 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:28:04,594 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-17 05:28:04,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:28:04,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:04,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:04,764 INFO L85 PathProgramCache]: Analyzing trace with hash 618363567, now seen corresponding path program 1 times [2025-03-17 05:28:04,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:28:04,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874336870] [2025-03-17 05:28:04,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:04,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:28:04,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:28:04,766 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:28:04,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:28:04,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:28:05,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:28:05,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:05,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:05,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:28:05,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:28:06,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:28:06,143 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:28:06,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874336870] [2025-03-17 05:28:06,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874336870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:06,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:28:06,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:28:06,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184239185] [2025-03-17 05:28:06,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:06,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:28:06,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:28:06,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:28:06,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:28:06,145 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:28:06,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:06,341 INFO L93 Difference]: Finished difference Result 241 states and 354 transitions. [2025-03-17 05:28:06,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:28:06,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2025-03-17 05:28:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:06,344 INFO L225 Difference]: With dead ends: 241 [2025-03-17 05:28:06,344 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 05:28:06,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:28:06,345 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:28:06,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:28:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 05:28:06,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-17 05:28:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 103 states have internal predecessors, (144), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:28:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2025-03-17 05:28:06,354 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 145 [2025-03-17 05:28:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:06,355 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2025-03-17 05:28:06,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:28:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2025-03-17 05:28:06,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:28:06,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:06,357 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:28:06,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 05:28:06,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:28:06,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:06,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:06,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1768728282, now seen corresponding path program 1 times [2025-03-17 05:28:06,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:28:06,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053900358] [2025-03-17 05:28:06,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:06,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:28:06,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:28:06,562 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:28:06,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 05:28:06,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:28:07,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:28:07,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:07,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:07,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:28:07,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:28:08,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:28:08,123 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:28:08,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053900358] [2025-03-17 05:28:08,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053900358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:08,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:28:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:28:08,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73528270] [2025-03-17 05:28:08,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:08,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:28:08,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:28:08,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:28:08,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:28:08,125 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:28:08,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:08,719 INFO L93 Difference]: Finished difference Result 250 states and 365 transitions. [2025-03-17 05:28:08,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:28:08,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2025-03-17 05:28:08,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:08,724 INFO L225 Difference]: With dead ends: 250 [2025-03-17 05:28:08,724 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 05:28:08,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:28:08,725 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:28:08,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 824 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:28:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 05:28:08,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2025-03-17 05:28:08,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 109 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:28:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 184 transitions. [2025-03-17 05:28:08,734 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 184 transitions. Word has length 147 [2025-03-17 05:28:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:08,734 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 184 transitions. [2025-03-17 05:28:08,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:28:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 184 transitions. [2025-03-17 05:28:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:28:08,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:08,736 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:28:08,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 05:28:08,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:28:08,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:08,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:08,937 INFO L85 PathProgramCache]: Analyzing trace with hash 718784551, now seen corresponding path program 1 times [2025-03-17 05:28:08,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:28:08,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468375305] [2025-03-17 05:28:08,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:08,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:28:08,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:28:08,940 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:28:08,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 05:28:09,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:28:10,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:28:10,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:10,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:10,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:28:10,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:28:10,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:28:10,644 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:28:10,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468375305] [2025-03-17 05:28:10,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468375305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:10,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:28:10,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:28:10,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789351553] [2025-03-17 05:28:10,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:10,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:28:10,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:28:10,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:28:10,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:28:10,647 INFO L87 Difference]: Start difference. First operand 128 states and 184 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:28:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:11,377 INFO L93 Difference]: Finished difference Result 258 states and 371 transitions. [2025-03-17 05:28:11,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:28:11,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2025-03-17 05:28:11,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:11,378 INFO L225 Difference]: With dead ends: 258 [2025-03-17 05:28:11,378 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 05:28:11,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:28:11,380 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:28:11,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 977 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:28:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 05:28:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2025-03-17 05:28:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 111 states have (on average 1.3693693693693694) internal successors, (152), 111 states have internal predecessors, (152), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:28:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 186 transitions. [2025-03-17 05:28:11,386 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 186 transitions. Word has length 147 [2025-03-17 05:28:11,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:11,386 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 186 transitions. [2025-03-17 05:28:11,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:28:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 186 transitions. [2025-03-17 05:28:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:28:11,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:11,392 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:28:11,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 05:28:11,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:28:11,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:11,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:11,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1606288232, now seen corresponding path program 1 times [2025-03-17 05:28:11,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:28:11,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088370496] [2025-03-17 05:28:11,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:11,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:28:11,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:28:11,595 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:28:11,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 05:28:11,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:28:12,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:28:12,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:12,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:12,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 05:28:12,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:28:13,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:28:13,532 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:28:13,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088370496] [2025-03-17 05:28:13,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088370496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:13,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:28:13,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:28:13,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363888564] [2025-03-17 05:28:13,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:13,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:28:13,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:28:13,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:28:13,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:28:13,534 INFO L87 Difference]: Start difference. First operand 130 states and 186 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:28:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:14,637 INFO L93 Difference]: Finished difference Result 262 states and 375 transitions. [2025-03-17 05:28:14,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:28:14,638 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2025-03-17 05:28:14,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:14,639 INFO L225 Difference]: With dead ends: 262 [2025-03-17 05:28:14,639 INFO L226 Difference]: Without dead ends: 133 [2025-03-17 05:28:14,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:28:14,640 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:28:14,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1132 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 05:28:14,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-17 05:28:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2025-03-17 05:28:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:28:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2025-03-17 05:28:14,649 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 147 [2025-03-17 05:28:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:14,649 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2025-03-17 05:28:14,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:28:14,650 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2025-03-17 05:28:14,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:28:14,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:14,653 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:28:14,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 05:28:14,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:28:14,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:14,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:14,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1607211753, now seen corresponding path program 1 times [2025-03-17 05:28:14,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:28:14,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694324478] [2025-03-17 05:28:14,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:14,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:28:14,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:28:14,858 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:28:14,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 05:28:14,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:28:15,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:28:15,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:15,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:16,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:28:16,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:17,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:28:17,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-17 05:28:17,413 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-17 05:28:17,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:28:17,413 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:28:17,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694324478] [2025-03-17 05:28:17,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694324478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:17,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:28:17,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:28:17,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929667758] [2025-03-17 05:28:17,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:17,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:28:17,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:28:17,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:28:17,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:28:17,416 INFO L87 Difference]: Start difference. First operand 132 states and 188 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:28:23,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:28:27,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:28:31,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:28:35,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:28:39,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 05:28:43,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 05:28:47,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:28:51,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 05:28:57,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:29:02,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 05:29:03,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers []