./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-13.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ab1505ae670373b6c322e0c16a487a3f348c7a8c6cd3865cdae18d40153ca8fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:30:24,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:30:24,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:30:24,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:30:24,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:30:24,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:30:24,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:30:24,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:30:24,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:30:24,821 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:30:24,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:30:24,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:30:24,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:30:24,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:30:24,822 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:30:24,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:30:24,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:30:24,823 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:30:24,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:30:24,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:30:24,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:30:24,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:30:24,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:30:24,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:30:24,823 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:30:24,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:30:24,823 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:30:24,823 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:30:24,823 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:30:24,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:30:24,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:30:24,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:30:24,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:30:24,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:30:24,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:30:24,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:30:24,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:30:24,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:30:24,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:30:24,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:30:24,824 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:30:24,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:30:24,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:30:24,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:30:24,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:30:24,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:30:24,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:30:24,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:30:24,824 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-jdk21/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 -> ab1505ae670373b6c322e0c16a487a3f348c7a8c6cd3865cdae18d40153ca8fc [2025-01-09 15:30:25,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:30:25,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:30:25,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:30:25,089 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:30:25,089 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:30:25,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-13.i [2025-01-09 15:30:26,216 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51627a3df/039db7fc84ac41ddaecd1be297e78fc4/FLAG6e8a7ffa0 [2025-01-09 15:30:26,481 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:30:26,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-13.i [2025-01-09 15:30:26,488 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51627a3df/039db7fc84ac41ddaecd1be297e78fc4/FLAG6e8a7ffa0 [2025-01-09 15:30:26,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51627a3df/039db7fc84ac41ddaecd1be297e78fc4 [2025-01-09 15:30:26,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:30:26,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:30:26,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:30:26,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:30:26,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:30:26,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:30:26" (1/1) ... [2025-01-09 15:30:26,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3da800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:26, skipping insertion in model container [2025-01-09 15:30:26,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:30:26" (1/1) ... [2025-01-09 15:30:26,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:30:26,962 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-13.i[917,930] [2025-01-09 15:30:27,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:30:27,023 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:30:27,030 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-13.i[917,930] [2025-01-09 15:30:27,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:30:27,080 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:30:27,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:27 WrapperNode [2025-01-09 15:30:27,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:30:27,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:30:27,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:30:27,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:30:27,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:27" (1/1) ... [2025-01-09 15:30:27,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:27" (1/1) ... [2025-01-09 15:30:27,115 INFO L138 Inliner]: procedures = 29, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 485 [2025-01-09 15:30:27,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:30:27,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:30:27,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:30:27,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:30:27,122 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:27" (1/1) ... [2025-01-09 15:30:27,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:27" (1/1) ... [2025-01-09 15:30:27,126 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:27" (1/1) ... [2025-01-09 15:30:27,147 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 8, 34, 31, 23, 17]. 30 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 4, 4, 1, 3]. The 15 writes are split as follows [0, 1, 4, 5, 1, 4]. [2025-01-09 15:30:27,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:27" (1/1) ... [2025-01-09 15:30:27,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:27" (1/1) ... [2025-01-09 15:30:27,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:27" (1/1) ... [2025-01-09 15:30:27,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:27" (1/1) ... [2025-01-09 15:30:27,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:27" (1/1) ... [2025-01-09 15:30:27,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:27" (1/1) ... [2025-01-09 15:30:27,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:27" (1/1) ... [2025-01-09 15:30:27,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:30:27,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:30:27,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:30:27,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:30:27,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:27" (1/1) ... [2025-01-09 15:30:27,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:30:27,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:30:27,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:30:27,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:30:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:30:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:30:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:30:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:30:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:30:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:30:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:30:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:30:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:30:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:30:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:30:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:30:27,241 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:30:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:30:27,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:30:27,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:30:27,369 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:30:27,371 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:30:27,689 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-01-09 15:30:27,690 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:30:27,697 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:30:27,697 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:30:27,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:30:27 BoogieIcfgContainer [2025-01-09 15:30:27,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:30:27,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:30:27,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:30:27,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:30:27,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:30:26" (1/3) ... [2025-01-09 15:30:27,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178c4a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:30:27, skipping insertion in model container [2025-01-09 15:30:27,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:27" (2/3) ... [2025-01-09 15:30:27,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178c4a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:30:27, skipping insertion in model container [2025-01-09 15:30:27,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:30:27" (3/3) ... [2025-01-09 15:30:27,704 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-13.i [2025-01-09 15:30:27,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:30:27,714 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-13.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:30:27,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:30:27,773 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;@363a1baf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:30:27,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:30:27,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:30:27,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:30:27,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:27,784 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:27,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:27,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:27,789 INFO L85 PathProgramCache]: Analyzing trace with hash -773158161, now seen corresponding path program 1 times [2025-01-09 15:30:27,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:27,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943300689] [2025-01-09 15:30:27,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:27,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:27,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:30:27,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:30:27,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:27,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 15:30:28,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:28,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943300689] [2025-01-09 15:30:28,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943300689] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:30:28,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414318834] [2025-01-09 15:30:28,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:28,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:30:28,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:30:28,094 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:30:28,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:30:28,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:30:28,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:30:28,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:28,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:28,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:30:28,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:30:28,284 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 15:30:28,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:30:28,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414318834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:28,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:30:28,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:30:28,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387963755] [2025-01-09 15:30:28,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:28,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:30:28,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:28,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:30:28,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:30:28,306 INFO L87 Difference]: Start difference. First operand has 111 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:30:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:28,324 INFO L93 Difference]: Finished difference Result 216 states and 338 transitions. [2025-01-09 15:30:28,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:30:28,326 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-01-09 15:30:28,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:28,330 INFO L225 Difference]: With dead ends: 216 [2025-01-09 15:30:28,330 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 15:30:28,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:30:28,335 INFO L435 NwaCegarLoop]: 159 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, 159 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-01-09 15:30:28,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:30:28,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 15:30:28,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-09 15:30:28,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:30:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2025-01-09 15:30:28,366 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 131 [2025-01-09 15:30:28,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:28,368 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2025-01-09 15:30:28,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:30:28,369 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2025-01-09 15:30:28,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:30:28,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:28,371 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:28,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:30:28,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:30:28,572 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:28,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:28,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1631701735, now seen corresponding path program 1 times [2025-01-09 15:30:28,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:28,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118154579] [2025-01-09 15:30:28,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:28,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:28,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:30:28,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:30:28,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:28,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:28,855 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:28,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:28,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118154579] [2025-01-09 15:30:28,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118154579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:28,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:28,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:30:28,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838868929] [2025-01-09 15:30:28,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:28,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:30:28,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:28,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:30:28,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:30:28,856 INFO L87 Difference]: Start difference. First operand 108 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:30:28,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:28,896 INFO L93 Difference]: Finished difference Result 215 states and 318 transitions. [2025-01-09 15:30:28,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:30:28,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-01-09 15:30:28,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:28,898 INFO L225 Difference]: With dead ends: 215 [2025-01-09 15:30:28,898 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 15:30:28,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:30:28,898 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 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-01-09 15:30:28,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:30:28,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 15:30:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 15:30:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:30:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2025-01-09 15:30:28,908 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 161 transitions. Word has length 131 [2025-01-09 15:30:28,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:28,909 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 161 transitions. [2025-01-09 15:30:28,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:30:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 161 transitions. [2025-01-09 15:30:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:30:28,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:28,910 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:28,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:30:28,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:28,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:28,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1750143209, now seen corresponding path program 1 times [2025-01-09 15:30:28,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:28,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98253669] [2025-01-09 15:30:28,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:28,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:28,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:30:28,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:30:28,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:28,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 15:30:29,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:29,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98253669] [2025-01-09 15:30:29,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98253669] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:30:29,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373188706] [2025-01-09 15:30:29,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:29,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:30:29,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:30:29,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:30:29,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:30:29,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:30:29,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:30:29,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:29,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:29,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:30:29,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:30:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:29,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:30:29,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373188706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:29,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:30:29,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 15:30:29,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642307055] [2025-01-09 15:30:29,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:29,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:30:29,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:29,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:30:29,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:30:29,441 INFO L87 Difference]: Start difference. First operand 110 states and 161 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:29,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:29,479 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2025-01-09 15:30:29,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:30:29,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-01-09 15:30:29,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:29,483 INFO L225 Difference]: With dead ends: 219 [2025-01-09 15:30:29,483 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 15:30:29,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 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-01-09 15:30:29,484 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 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-01-09 15:30:29,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:30:29,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 15:30:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-09 15:30:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:30:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 163 transitions. [2025-01-09 15:30:29,496 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 163 transitions. Word has length 131 [2025-01-09 15:30:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:29,496 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 163 transitions. [2025-01-09 15:30:29,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 163 transitions. [2025-01-09 15:30:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:30:29,498 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:29,498 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:29,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:30:29,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:30:29,699 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:29,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:29,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1069864882, now seen corresponding path program 1 times [2025-01-09 15:30:29,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:29,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781296899] [2025-01-09 15:30:29,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:29,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:29,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:30:29,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:30:29,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:29,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:30,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:30,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781296899] [2025-01-09 15:30:30,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781296899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:30,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:30,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:30:30,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697105979] [2025-01-09 15:30:30,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:30,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:30:30,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:30,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:30:30,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:30:30,065 INFO L87 Difference]: Start difference. First operand 112 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:30:30,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:30,153 INFO L93 Difference]: Finished difference Result 330 states and 483 transitions. [2025-01-09 15:30:30,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:30:30,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2025-01-09 15:30:30,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:30,155 INFO L225 Difference]: With dead ends: 330 [2025-01-09 15:30:30,155 INFO L226 Difference]: Without dead ends: 221 [2025-01-09 15:30:30,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:30:30,156 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 114 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:30,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 573 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:30:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-01-09 15:30:30,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 213. [2025-01-09 15:30:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 180 states have (on average 1.4) internal successors, (252), 180 states have internal predecessors, (252), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:30:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 312 transitions. [2025-01-09 15:30:30,186 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 312 transitions. Word has length 133 [2025-01-09 15:30:30,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:30,187 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 312 transitions. [2025-01-09 15:30:30,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:30:30,187 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 312 transitions. [2025-01-09 15:30:30,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:30:30,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:30,192 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:30,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:30:30,192 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:30,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:30,193 INFO L85 PathProgramCache]: Analyzing trace with hash 252216432, now seen corresponding path program 1 times [2025-01-09 15:30:30,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:30,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918786701] [2025-01-09 15:30:30,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:30,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:30,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:30:30,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:30:30,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:30,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:30,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:30,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918786701] [2025-01-09 15:30:30,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918786701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:30,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:30,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:30:30,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29342481] [2025-01-09 15:30:30,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:30,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:30:30,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:30,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:30:30,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:30:30,560 INFO L87 Difference]: Start difference. First operand 213 states and 312 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:30,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:30,627 INFO L93 Difference]: Finished difference Result 471 states and 690 transitions. [2025-01-09 15:30:30,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:30:30,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2025-01-09 15:30:30,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:30,630 INFO L225 Difference]: With dead ends: 471 [2025-01-09 15:30:30,631 INFO L226 Difference]: Without dead ends: 261 [2025-01-09 15:30:30,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:30:30,633 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 60 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:30,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 606 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:30:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-01-09 15:30:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 218. [2025-01-09 15:30:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 185 states have (on average 1.3945945945945946) internal successors, (258), 185 states have internal predecessors, (258), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:30:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 318 transitions. [2025-01-09 15:30:30,671 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 318 transitions. Word has length 133 [2025-01-09 15:30:30,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:30,672 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 318 transitions. [2025-01-09 15:30:30,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 318 transitions. [2025-01-09 15:30:30,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:30:30,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:30,673 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:30,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:30:30,673 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:30,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:30,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1336131470, now seen corresponding path program 1 times [2025-01-09 15:30:30,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:30,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966439088] [2025-01-09 15:30:30,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:30,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:30,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:30:30,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:30:30,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:30,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:30,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:30,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966439088] [2025-01-09 15:30:30,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966439088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:30,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:30,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:30:30,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099596487] [2025-01-09 15:30:30,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:30,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:30:30,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:30,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:30:30,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:30:30,865 INFO L87 Difference]: Start difference. First operand 218 states and 318 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:30,918 INFO L93 Difference]: Finished difference Result 468 states and 682 transitions. [2025-01-09 15:30:30,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:30:30,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2025-01-09 15:30:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:30,922 INFO L225 Difference]: With dead ends: 468 [2025-01-09 15:30:30,922 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 15:30:30,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:30:30,924 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 51 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:30,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 607 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:30:30,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 15:30:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 222. [2025-01-09 15:30:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 189 states have (on average 1.3915343915343916) internal successors, (263), 189 states have internal predecessors, (263), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:30:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 323 transitions. [2025-01-09 15:30:30,933 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 323 transitions. Word has length 133 [2025-01-09 15:30:30,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:30,934 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 323 transitions. [2025-01-09 15:30:30,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 323 transitions. [2025-01-09 15:30:30,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:30:30,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:30,935 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:30,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:30:30,935 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:30,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:30,936 INFO L85 PathProgramCache]: Analyzing trace with hash 911746967, now seen corresponding path program 1 times [2025-01-09 15:30:30,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:30,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917845134] [2025-01-09 15:30:30,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:30,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:30,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:30:30,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:30:30,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:30,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:31,315 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:31,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:31,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917845134] [2025-01-09 15:30:31,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917845134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:31,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:31,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:30:31,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710527019] [2025-01-09 15:30:31,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:31,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:30:31,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:31,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:30:31,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:30:31,317 INFO L87 Difference]: Start difference. First operand 222 states and 323 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:31,525 INFO L93 Difference]: Finished difference Result 609 states and 884 transitions. [2025-01-09 15:30:31,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:30:31,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-01-09 15:30:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:31,528 INFO L225 Difference]: With dead ends: 609 [2025-01-09 15:30:31,528 INFO L226 Difference]: Without dead ends: 390 [2025-01-09 15:30:31,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:30:31,529 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 260 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:31,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 877 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:30:31,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-01-09 15:30:31,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 386. [2025-01-09 15:30:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 339 states have (on average 1.40117994100295) internal successors, (475), 341 states have internal predecessors, (475), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 15:30:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 559 transitions. [2025-01-09 15:30:31,549 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 559 transitions. Word has length 134 [2025-01-09 15:30:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:31,550 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 559 transitions. [2025-01-09 15:30:31,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 559 transitions. [2025-01-09 15:30:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:30:31,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:31,551 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:31,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:30:31,551 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:31,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:31,552 INFO L85 PathProgramCache]: Analyzing trace with hash 518719957, now seen corresponding path program 1 times [2025-01-09 15:30:31,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:31,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437376083] [2025-01-09 15:30:31,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:31,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:31,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:30:31,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:30:31,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:31,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:32,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:32,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437376083] [2025-01-09 15:30:32,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437376083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:32,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:32,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:30:32,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950313858] [2025-01-09 15:30:32,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:32,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:30:32,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:32,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:30:32,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:30:32,077 INFO L87 Difference]: Start difference. First operand 386 states and 559 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:32,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:32,307 INFO L93 Difference]: Finished difference Result 897 states and 1297 transitions. [2025-01-09 15:30:32,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:30:32,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-01-09 15:30:32,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:32,313 INFO L225 Difference]: With dead ends: 897 [2025-01-09 15:30:32,314 INFO L226 Difference]: Without dead ends: 514 [2025-01-09 15:30:32,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:30:32,315 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 119 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:32,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 713 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:30:32,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-01-09 15:30:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 502. [2025-01-09 15:30:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 434 states have (on average 1.3847926267281105) internal successors, (601), 437 states have internal predecessors, (601), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 15:30:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 721 transitions. [2025-01-09 15:30:32,369 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 721 transitions. Word has length 134 [2025-01-09 15:30:32,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:32,370 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 721 transitions. [2025-01-09 15:30:32,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:32,370 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 721 transitions. [2025-01-09 15:30:32,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:30:32,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:32,372 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:32,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:30:32,372 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:32,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:32,372 INFO L85 PathProgramCache]: Analyzing trace with hash 94098517, now seen corresponding path program 1 times [2025-01-09 15:30:32,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:32,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341040970] [2025-01-09 15:30:32,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:32,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:32,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:30:32,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:30:32,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:32,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:32,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:32,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341040970] [2025-01-09 15:30:32,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341040970] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:32,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:32,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:30:32,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240471131] [2025-01-09 15:30:32,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:32,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:30:32,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:32,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:30:32,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:30:32,844 INFO L87 Difference]: Start difference. First operand 502 states and 721 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:33,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:33,065 INFO L93 Difference]: Finished difference Result 1094 states and 1568 transitions. [2025-01-09 15:30:33,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:30:33,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-01-09 15:30:33,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:33,069 INFO L225 Difference]: With dead ends: 1094 [2025-01-09 15:30:33,070 INFO L226 Difference]: Without dead ends: 595 [2025-01-09 15:30:33,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:30:33,072 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 220 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:33,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 475 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:30:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-01-09 15:30:33,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 591. [2025-01-09 15:30:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 509 states have (on average 1.3772102161100197) internal successors, (701), 513 states have internal predecessors, (701), 72 states have call successors, (72), 9 states have call predecessors, (72), 9 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 15:30:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 845 transitions. [2025-01-09 15:30:33,118 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 845 transitions. Word has length 134 [2025-01-09 15:30:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:33,119 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 845 transitions. [2025-01-09 15:30:33,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 845 transitions. [2025-01-09 15:30:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:30:33,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:33,121 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:33,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:30:33,123 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:33,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash -298928493, now seen corresponding path program 1 times [2025-01-09 15:30:33,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:33,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328139106] [2025-01-09 15:30:33,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:33,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:33,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:30:33,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:30:33,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:33,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:33,315 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:33,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:33,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328139106] [2025-01-09 15:30:33,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328139106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:33,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:33,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:30:33,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914250141] [2025-01-09 15:30:33,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:33,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:30:33,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:33,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:30:33,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:30:33,318 INFO L87 Difference]: Start difference. First operand 591 states and 845 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:33,460 INFO L93 Difference]: Finished difference Result 1239 states and 1764 transitions. [2025-01-09 15:30:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:30:33,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-01-09 15:30:33,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:33,463 INFO L225 Difference]: With dead ends: 1239 [2025-01-09 15:30:33,463 INFO L226 Difference]: Without dead ends: 651 [2025-01-09 15:30:33,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:30:33,464 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 106 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:33,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1070 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:30:33,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-01-09 15:30:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 506. [2025-01-09 15:30:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 436 states have (on average 1.3669724770642202) internal successors, (596), 439 states have internal predecessors, (596), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 15:30:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 716 transitions. [2025-01-09 15:30:33,500 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 716 transitions. Word has length 134 [2025-01-09 15:30:33,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:33,500 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 716 transitions. [2025-01-09 15:30:33,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:33,500 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 716 transitions. [2025-01-09 15:30:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:30:33,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:33,522 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:33,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:30:33,523 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:33,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:33,523 INFO L85 PathProgramCache]: Analyzing trace with hash -606966061, now seen corresponding path program 1 times [2025-01-09 15:30:33,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:33,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411210277] [2025-01-09 15:30:33,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:33,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:33,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:30:33,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:30:33,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:33,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:33,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:33,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411210277] [2025-01-09 15:30:33,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411210277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:33,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:33,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:30:33,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358801473] [2025-01-09 15:30:33,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:33,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:30:33,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:33,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:30:33,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:30:33,707 INFO L87 Difference]: Start difference. First operand 506 states and 716 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:30:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:33,789 INFO L93 Difference]: Finished difference Result 982 states and 1387 transitions. [2025-01-09 15:30:33,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:30:33,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-01-09 15:30:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:33,792 INFO L225 Difference]: With dead ends: 982 [2025-01-09 15:30:33,792 INFO L226 Difference]: Without dead ends: 514 [2025-01-09 15:30:33,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:30:33,793 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 106 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:33,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 600 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:30:33,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-01-09 15:30:33,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 502. [2025-01-09 15:30:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 432 states have (on average 1.3634259259259258) internal successors, (589), 435 states have internal predecessors, (589), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 15:30:33,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 709 transitions. [2025-01-09 15:30:33,825 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 709 transitions. Word has length 134 [2025-01-09 15:30:33,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:33,825 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 709 transitions. [2025-01-09 15:30:33,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:30:33,825 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 709 transitions. [2025-01-09 15:30:33,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:30:33,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:33,826 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:33,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:30:33,827 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:33,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:33,827 INFO L85 PathProgramCache]: Analyzing trace with hash -727897289, now seen corresponding path program 1 times [2025-01-09 15:30:33,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:33,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389999323] [2025-01-09 15:30:33,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:33,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:33,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:30:33,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:30:33,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:33,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:34,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:34,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389999323] [2025-01-09 15:30:34,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389999323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:34,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:34,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:30:34,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364508863] [2025-01-09 15:30:34,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:34,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:30:34,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:34,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:30:34,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:30:34,072 INFO L87 Difference]: Start difference. First operand 502 states and 709 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:34,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:34,355 INFO L93 Difference]: Finished difference Result 1325 states and 1867 transitions. [2025-01-09 15:30:34,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:30:34,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-01-09 15:30:34,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:34,359 INFO L225 Difference]: With dead ends: 1325 [2025-01-09 15:30:34,359 INFO L226 Difference]: Without dead ends: 1052 [2025-01-09 15:30:34,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:30:34,360 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 330 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:34,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1321 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:30:34,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2025-01-09 15:30:34,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 883. [2025-01-09 15:30:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 764 states have (on average 1.361256544502618) internal successors, (1040), 768 states have internal predecessors, (1040), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 15:30:34,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1244 transitions. [2025-01-09 15:30:34,420 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1244 transitions. Word has length 135 [2025-01-09 15:30:34,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:34,421 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1244 transitions. [2025-01-09 15:30:34,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1244 transitions. [2025-01-09 15:30:34,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:30:34,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:34,422 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:34,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:30:34,422 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:34,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:34,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1545545739, now seen corresponding path program 1 times [2025-01-09 15:30:34,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:34,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185458789] [2025-01-09 15:30:34,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:34,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:34,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:30:34,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:30:34,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:34,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:34,539 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:34,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:34,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185458789] [2025-01-09 15:30:34,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185458789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:34,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:34,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:30:34,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177129579] [2025-01-09 15:30:34,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:34,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:30:34,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:34,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:30:34,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:30:34,541 INFO L87 Difference]: Start difference. First operand 883 states and 1244 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:34,607 INFO L93 Difference]: Finished difference Result 1422 states and 2013 transitions. [2025-01-09 15:30:34,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:30:34,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-01-09 15:30:34,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:34,611 INFO L225 Difference]: With dead ends: 1422 [2025-01-09 15:30:34,611 INFO L226 Difference]: Without dead ends: 883 [2025-01-09 15:30:34,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:30:34,613 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:34,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:30:34,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-01-09 15:30:34,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2025-01-09 15:30:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 764 states have (on average 1.3586387434554974) internal successors, (1038), 768 states have internal predecessors, (1038), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 15:30:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1242 transitions. [2025-01-09 15:30:34,677 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1242 transitions. Word has length 135 [2025-01-09 15:30:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:34,677 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1242 transitions. [2025-01-09 15:30:34,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:34,677 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1242 transitions. [2025-01-09 15:30:34,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:30:34,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:34,679 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:34,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:30:34,679 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:34,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:34,679 INFO L85 PathProgramCache]: Analyzing trace with hash 943983223, now seen corresponding path program 1 times [2025-01-09 15:30:34,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:34,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312647607] [2025-01-09 15:30:34,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:34,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:34,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:30:34,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:30:34,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:34,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:34,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:34,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312647607] [2025-01-09 15:30:34,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312647607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:34,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:34,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:30:34,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060473680] [2025-01-09 15:30:34,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:34,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:30:34,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:34,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:30:34,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:30:34,801 INFO L87 Difference]: Start difference. First operand 883 states and 1242 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:34,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:34,871 INFO L93 Difference]: Finished difference Result 1422 states and 2009 transitions. [2025-01-09 15:30:34,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:30:34,872 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-01-09 15:30:34,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:34,875 INFO L225 Difference]: With dead ends: 1422 [2025-01-09 15:30:34,875 INFO L226 Difference]: Without dead ends: 883 [2025-01-09 15:30:34,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:30:34,876 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:34,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 443 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:30:34,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-01-09 15:30:34,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2025-01-09 15:30:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 764 states have (on average 1.3481675392670156) internal successors, (1030), 768 states have internal predecessors, (1030), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 15:30:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1234 transitions. [2025-01-09 15:30:34,931 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1234 transitions. Word has length 135 [2025-01-09 15:30:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:34,931 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1234 transitions. [2025-01-09 15:30:34,931 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1234 transitions. [2025-01-09 15:30:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:30:34,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:34,932 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:34,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:30:34,933 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:34,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:34,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1202148661, now seen corresponding path program 1 times [2025-01-09 15:30:34,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:34,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007394613] [2025-01-09 15:30:34,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:34,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:34,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:30:34,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:30:34,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:34,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:35,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:35,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007394613] [2025-01-09 15:30:35,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007394613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:35,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:35,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:30:35,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001684672] [2025-01-09 15:30:35,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:35,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:30:35,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:35,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:30:35,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:30:35,455 INFO L87 Difference]: Start difference. First operand 883 states and 1234 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:35,976 INFO L93 Difference]: Finished difference Result 1244 states and 1734 transitions. [2025-01-09 15:30:35,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:30:35,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-01-09 15:30:35,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:35,980 INFO L225 Difference]: With dead ends: 1244 [2025-01-09 15:30:35,980 INFO L226 Difference]: Without dead ends: 976 [2025-01-09 15:30:35,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:30:35,981 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 273 mSDsluCounter, 2138 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:35,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 2475 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:30:35,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-01-09 15:30:36,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 879. [2025-01-09 15:30:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 760 states have (on average 1.3473684210526315) internal successors, (1024), 764 states have internal predecessors, (1024), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 15:30:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1228 transitions. [2025-01-09 15:30:36,034 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1228 transitions. Word has length 135 [2025-01-09 15:30:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:36,035 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1228 transitions. [2025-01-09 15:30:36,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1228 transitions. [2025-01-09 15:30:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:30:36,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:36,036 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:36,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:30:36,036 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:36,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:36,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1692701627, now seen corresponding path program 1 times [2025-01-09 15:30:36,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:36,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972331558] [2025-01-09 15:30:36,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:36,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:36,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:30:36,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:30:36,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:36,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:36,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:36,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972331558] [2025-01-09 15:30:36,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972331558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:36,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:36,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:30:36,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938403858] [2025-01-09 15:30:36,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:36,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:30:36,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:36,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:30:36,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:30:36,176 INFO L87 Difference]: Start difference. First operand 879 states and 1228 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:36,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:36,227 INFO L93 Difference]: Finished difference Result 1398 states and 1957 transitions. [2025-01-09 15:30:36,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:30:36,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-01-09 15:30:36,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:36,230 INFO L225 Difference]: With dead ends: 1398 [2025-01-09 15:30:36,230 INFO L226 Difference]: Without dead ends: 863 [2025-01-09 15:30:36,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:30:36,232 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:36,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:30:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-01-09 15:30:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2025-01-09 15:30:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 744 states have (on average 1.3239247311827957) internal successors, (985), 748 states have internal predecessors, (985), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 15:30:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1189 transitions. [2025-01-09 15:30:36,281 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1189 transitions. Word has length 135 [2025-01-09 15:30:36,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:36,281 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1189 transitions. [2025-01-09 15:30:36,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:36,282 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1189 transitions. [2025-01-09 15:30:36,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:30:36,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:36,283 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:36,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:30:36,283 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:36,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:36,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2081836725, now seen corresponding path program 1 times [2025-01-09 15:30:36,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:36,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062614347] [2025-01-09 15:30:36,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:36,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:36,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:30:36,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:30:36,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:36,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:36,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:36,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062614347] [2025-01-09 15:30:36,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062614347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:36,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:36,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:30:36,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326195229] [2025-01-09 15:30:36,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:36,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:30:36,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:36,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:30:36,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:30:36,679 INFO L87 Difference]: Start difference. First operand 863 states and 1189 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:37,188 INFO L93 Difference]: Finished difference Result 1591 states and 2192 transitions. [2025-01-09 15:30:37,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:30:37,189 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-01-09 15:30:37,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:37,193 INFO L225 Difference]: With dead ends: 1591 [2025-01-09 15:30:37,193 INFO L226 Difference]: Without dead ends: 1072 [2025-01-09 15:30:37,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:30:37,194 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 316 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:37,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1798 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:30:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-01-09 15:30:37,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 881. [2025-01-09 15:30:37,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 762 states have (on average 1.3241469816272966) internal successors, (1009), 766 states have internal predecessors, (1009), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 15:30:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1213 transitions. [2025-01-09 15:30:37,244 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1213 transitions. Word has length 135 [2025-01-09 15:30:37,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:37,244 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1213 transitions. [2025-01-09 15:30:37,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1213 transitions. [2025-01-09 15:30:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:30:37,245 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:37,245 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:37,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:30:37,246 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:37,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:37,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1264188275, now seen corresponding path program 1 times [2025-01-09 15:30:37,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:37,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464065713] [2025-01-09 15:30:37,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:37,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:37,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:30:37,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:30:37,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:37,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:37,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:37,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464065713] [2025-01-09 15:30:37,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464065713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:37,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:37,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:30:37,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665703303] [2025-01-09 15:30:37,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:37,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:30:37,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:37,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:30:37,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:30:37,513 INFO L87 Difference]: Start difference. First operand 881 states and 1213 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:37,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:37,782 INFO L93 Difference]: Finished difference Result 1470 states and 2024 transitions. [2025-01-09 15:30:37,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:30:37,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-01-09 15:30:37,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:37,787 INFO L225 Difference]: With dead ends: 1470 [2025-01-09 15:30:37,787 INFO L226 Difference]: Without dead ends: 933 [2025-01-09 15:30:37,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:30:37,788 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 223 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:37,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1354 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:30:37,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-01-09 15:30:37,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 844. [2025-01-09 15:30:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 725 states have (on average 1.3144827586206898) internal successors, (953), 729 states have internal predecessors, (953), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 15:30:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1157 transitions. [2025-01-09 15:30:37,832 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1157 transitions. Word has length 135 [2025-01-09 15:30:37,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:37,832 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1157 transitions. [2025-01-09 15:30:37,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1157 transitions. [2025-01-09 15:30:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 15:30:37,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:37,834 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:37,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:30:37,834 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:37,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:37,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1357112686, now seen corresponding path program 1 times [2025-01-09 15:30:37,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:37,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355781106] [2025-01-09 15:30:37,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:37,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:37,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 15:30:37,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 15:30:37,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:37,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:37,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:37,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355781106] [2025-01-09 15:30:37,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355781106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:37,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:37,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:30:37,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465672533] [2025-01-09 15:30:37,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:37,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:30:37,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:37,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:30:37,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:30:37,940 INFO L87 Difference]: Start difference. First operand 844 states and 1157 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:38,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:38,011 INFO L93 Difference]: Finished difference Result 1473 states and 2021 transitions. [2025-01-09 15:30:38,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:30:38,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2025-01-09 15:30:38,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:38,015 INFO L225 Difference]: With dead ends: 1473 [2025-01-09 15:30:38,015 INFO L226 Difference]: Without dead ends: 973 [2025-01-09 15:30:38,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:30:38,017 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 53 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:38,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 713 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:30:38,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2025-01-09 15:30:38,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 844. [2025-01-09 15:30:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 725 states have (on average 1.3062068965517242) internal successors, (947), 729 states have internal predecessors, (947), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 15:30:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1151 transitions. [2025-01-09 15:30:38,060 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1151 transitions. Word has length 136 [2025-01-09 15:30:38,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:38,060 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1151 transitions. [2025-01-09 15:30:38,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:38,060 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1151 transitions. [2025-01-09 15:30:38,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 15:30:38,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:38,061 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:38,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:30:38,062 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:38,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:38,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1184403994, now seen corresponding path program 1 times [2025-01-09 15:30:38,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:38,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183606659] [2025-01-09 15:30:38,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:38,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:38,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 15:30:38,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 15:30:38,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:38,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:38,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:38,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183606659] [2025-01-09 15:30:38,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183606659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:38,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:38,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:30:38,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714716113] [2025-01-09 15:30:38,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:38,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:30:38,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:38,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:30:38,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:30:38,592 INFO L87 Difference]: Start difference. First operand 844 states and 1151 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:38,949 INFO L93 Difference]: Finished difference Result 1751 states and 2399 transitions. [2025-01-09 15:30:38,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:30:38,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2025-01-09 15:30:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:38,955 INFO L225 Difference]: With dead ends: 1751 [2025-01-09 15:30:38,955 INFO L226 Difference]: Without dead ends: 1251 [2025-01-09 15:30:38,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:30:38,958 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 339 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:38,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 633 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:30:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2025-01-09 15:30:39,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 848. [2025-01-09 15:30:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 729 states have (on average 1.3072702331961592) internal successors, (953), 733 states have internal predecessors, (953), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 15:30:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1157 transitions. [2025-01-09 15:30:39,009 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1157 transitions. Word has length 136 [2025-01-09 15:30:39,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:39,010 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1157 transitions. [2025-01-09 15:30:39,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:39,010 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1157 transitions. [2025-01-09 15:30:39,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 15:30:39,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:39,012 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:39,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:30:39,012 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:39,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:39,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1796285722, now seen corresponding path program 1 times [2025-01-09 15:30:39,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:39,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498756430] [2025-01-09 15:30:39,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:39,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:39,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 15:30:39,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 15:30:39,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:39,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:39,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:39,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498756430] [2025-01-09 15:30:39,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498756430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:39,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:39,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:30:39,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442299580] [2025-01-09 15:30:39,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:39,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:30:39,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:39,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:30:39,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:30:39,470 INFO L87 Difference]: Start difference. First operand 848 states and 1157 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:39,791 INFO L93 Difference]: Finished difference Result 1749 states and 2398 transitions. [2025-01-09 15:30:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:30:39,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2025-01-09 15:30:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:39,797 INFO L225 Difference]: With dead ends: 1749 [2025-01-09 15:30:39,797 INFO L226 Difference]: Without dead ends: 1245 [2025-01-09 15:30:39,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:30:39,799 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 258 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:39,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 612 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:30:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2025-01-09 15:30:39,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 834. [2025-01-09 15:30:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 715 states have (on average 1.3076923076923077) internal successors, (935), 719 states have internal predecessors, (935), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 15:30:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1139 transitions. [2025-01-09 15:30:39,845 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1139 transitions. Word has length 136 [2025-01-09 15:30:39,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:39,845 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1139 transitions. [2025-01-09 15:30:39,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1139 transitions. [2025-01-09 15:30:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 15:30:39,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:39,848 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:39,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:30:39,848 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:39,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:39,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1095221144, now seen corresponding path program 1 times [2025-01-09 15:30:39,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:39,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113913057] [2025-01-09 15:30:39,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:39,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:39,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 15:30:39,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 15:30:39,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:39,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:40,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:40,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113913057] [2025-01-09 15:30:40,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113913057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:40,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:40,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:30:40,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193697532] [2025-01-09 15:30:40,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:40,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:30:40,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:40,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:30:40,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:30:40,046 INFO L87 Difference]: Start difference. First operand 834 states and 1139 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:30:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:40,221 INFO L93 Difference]: Finished difference Result 1753 states and 2400 transitions. [2025-01-09 15:30:40,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:30:40,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-01-09 15:30:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:40,227 INFO L225 Difference]: With dead ends: 1753 [2025-01-09 15:30:40,227 INFO L226 Difference]: Without dead ends: 1263 [2025-01-09 15:30:40,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:30:40,230 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 174 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:40,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 584 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:30:40,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2025-01-09 15:30:40,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1257. [2025-01-09 15:30:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1076 states have (on average 1.308550185873606) internal successors, (1408), 1082 states have internal predecessors, (1408), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2025-01-09 15:30:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1720 transitions. [2025-01-09 15:30:40,334 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1720 transitions. Word has length 136 [2025-01-09 15:30:40,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:40,335 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1720 transitions. [2025-01-09 15:30:40,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:30:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1720 transitions. [2025-01-09 15:30:40,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 15:30:40,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:40,336 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:40,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 15:30:40,336 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:40,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:40,337 INFO L85 PathProgramCache]: Analyzing trace with hash 116048656, now seen corresponding path program 1 times [2025-01-09 15:30:40,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:40,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592213133] [2025-01-09 15:30:40,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:40,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:40,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 15:30:40,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 15:30:40,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:40,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:40,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:40,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592213133] [2025-01-09 15:30:40,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592213133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:40,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:40,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:30:40,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291134547] [2025-01-09 15:30:40,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:40,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:30:40,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:41,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:30:41,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:30:41,000 INFO L87 Difference]: Start difference. First operand 1257 states and 1720 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:41,623 INFO L93 Difference]: Finished difference Result 1603 states and 2188 transitions. [2025-01-09 15:30:41,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:30:41,624 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2025-01-09 15:30:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:41,629 INFO L225 Difference]: With dead ends: 1603 [2025-01-09 15:30:41,629 INFO L226 Difference]: Without dead ends: 1352 [2025-01-09 15:30:41,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:30:41,630 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 566 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:41,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1792 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:30:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-01-09 15:30:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1245. [2025-01-09 15:30:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 1064 states have (on average 1.3101503759398496) internal successors, (1394), 1070 states have internal predecessors, (1394), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2025-01-09 15:30:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1706 transitions. [2025-01-09 15:30:41,700 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1706 transitions. Word has length 137 [2025-01-09 15:30:41,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:41,700 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1706 transitions. [2025-01-09 15:30:41,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:41,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1706 transitions. [2025-01-09 15:30:41,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 15:30:41,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:41,701 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:41,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 15:30:41,702 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:41,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:41,702 INFO L85 PathProgramCache]: Analyzing trace with hash -612279152, now seen corresponding path program 1 times [2025-01-09 15:30:41,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:41,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087090560] [2025-01-09 15:30:41,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:41,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:41,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 15:30:41,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 15:30:41,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:41,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:42,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:42,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087090560] [2025-01-09 15:30:42,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087090560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:42,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:42,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:30:42,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777781272] [2025-01-09 15:30:42,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:42,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:30:42,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:42,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:30:42,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:30:42,103 INFO L87 Difference]: Start difference. First operand 1245 states and 1706 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:42,563 INFO L93 Difference]: Finished difference Result 1898 states and 2601 transitions. [2025-01-09 15:30:42,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:30:42,564 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2025-01-09 15:30:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:42,569 INFO L225 Difference]: With dead ends: 1898 [2025-01-09 15:30:42,569 INFO L226 Difference]: Without dead ends: 1420 [2025-01-09 15:30:42,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:30:42,571 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 303 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:42,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1988 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:30:42,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2025-01-09 15:30:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1239. [2025-01-09 15:30:42,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1058 states have (on average 1.3109640831758034) internal successors, (1387), 1064 states have internal predecessors, (1387), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2025-01-09 15:30:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1699 transitions. [2025-01-09 15:30:42,654 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1699 transitions. Word has length 137 [2025-01-09 15:30:42,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:42,654 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1699 transitions. [2025-01-09 15:30:42,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1699 transitions. [2025-01-09 15:30:42,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 15:30:42,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:42,656 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:42,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:30:42,657 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:42,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:42,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1387791669, now seen corresponding path program 1 times [2025-01-09 15:30:42,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:42,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595328093] [2025-01-09 15:30:42,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:42,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:42,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 15:30:42,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 15:30:42,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:42,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:42,868 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:42,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:42,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595328093] [2025-01-09 15:30:42,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595328093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:42,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:42,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:30:42,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393037472] [2025-01-09 15:30:42,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:42,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:30:42,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:42,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:30:42,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:30:42,870 INFO L87 Difference]: Start difference. First operand 1239 states and 1699 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:43,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:43,135 INFO L93 Difference]: Finished difference Result 1575 states and 2154 transitions. [2025-01-09 15:30:43,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:30:43,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2025-01-09 15:30:43,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:43,140 INFO L225 Difference]: With dead ends: 1575 [2025-01-09 15:30:43,140 INFO L226 Difference]: Without dead ends: 1336 [2025-01-09 15:30:43,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:30:43,141 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 237 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:43,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1582 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:30:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2025-01-09 15:30:43,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1253. [2025-01-09 15:30:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1072 states have (on average 1.3069029850746268) internal successors, (1401), 1078 states have internal predecessors, (1401), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2025-01-09 15:30:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1713 transitions. [2025-01-09 15:30:43,219 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1713 transitions. Word has length 138 [2025-01-09 15:30:43,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:43,219 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1713 transitions. [2025-01-09 15:30:43,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:43,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1713 transitions. [2025-01-09 15:30:43,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 15:30:43,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:43,221 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:43,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:30:43,221 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:43,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:43,221 INFO L85 PathProgramCache]: Analyzing trace with hash 373648951, now seen corresponding path program 1 times [2025-01-09 15:30:43,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:43,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670067760] [2025-01-09 15:30:43,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:43,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:43,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 15:30:43,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 15:30:43,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:43,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:43,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:43,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670067760] [2025-01-09 15:30:43,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670067760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:43,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:43,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:30:43,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215489725] [2025-01-09 15:30:43,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:43,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:30:43,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:43,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:30:43,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:30:43,363 INFO L87 Difference]: Start difference. First operand 1253 states and 1713 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:43,503 INFO L93 Difference]: Finished difference Result 2335 states and 3189 transitions. [2025-01-09 15:30:43,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:30:43,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2025-01-09 15:30:43,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:43,508 INFO L225 Difference]: With dead ends: 2335 [2025-01-09 15:30:43,509 INFO L226 Difference]: Without dead ends: 1416 [2025-01-09 15:30:43,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:30:43,511 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 199 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:43,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 652 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:30:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2025-01-09 15:30:43,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1256. [2025-01-09 15:30:43,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 1075 states have (on average 1.302325581395349) internal successors, (1400), 1081 states have internal predecessors, (1400), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2025-01-09 15:30:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1712 transitions. [2025-01-09 15:30:43,580 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1712 transitions. Word has length 138 [2025-01-09 15:30:43,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:43,580 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1712 transitions. [2025-01-09 15:30:43,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:43,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1712 transitions. [2025-01-09 15:30:43,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 15:30:43,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:43,581 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:43,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 15:30:43,582 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:43,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:43,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1193762397, now seen corresponding path program 1 times [2025-01-09 15:30:43,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:43,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157609697] [2025-01-09 15:30:43,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:43,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:43,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 15:30:43,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 15:30:43,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:43,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 15:30:43,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:43,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157609697] [2025-01-09 15:30:43,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157609697] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:30:43,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93713446] [2025-01-09 15:30:43,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:43,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:30:43,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:30:43,689 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:30:43,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:30:43,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 15:30:43,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 15:30:43,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:43,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:43,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:30:43,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:30:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:44,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:30:44,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93713446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:44,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:30:44,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-01-09 15:30:44,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126034993] [2025-01-09 15:30:44,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:44,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:30:44,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:44,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:30:44,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:30:44,003 INFO L87 Difference]: Start difference. First operand 1256 states and 1712 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:44,150 INFO L93 Difference]: Finished difference Result 2518 states and 3423 transitions. [2025-01-09 15:30:44,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:30:44,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2025-01-09 15:30:44,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:44,157 INFO L225 Difference]: With dead ends: 2518 [2025-01-09 15:30:44,158 INFO L226 Difference]: Without dead ends: 1300 [2025-01-09 15:30:44,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:30:44,161 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:44,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 720 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:30:44,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2025-01-09 15:30:44,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1300. [2025-01-09 15:30:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1119 states have (on average 1.290437890974084) internal successors, (1444), 1125 states have internal predecessors, (1444), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2025-01-09 15:30:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1756 transitions. [2025-01-09 15:30:44,265 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1756 transitions. Word has length 139 [2025-01-09 15:30:44,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:44,265 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1756 transitions. [2025-01-09 15:30:44,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1756 transitions. [2025-01-09 15:30:44,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 15:30:44,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:44,266 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:44,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 15:30:44,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:30:44,471 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:44,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:44,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1304866703, now seen corresponding path program 1 times [2025-01-09 15:30:44,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:44,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297184545] [2025-01-09 15:30:44,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:44,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:44,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 15:30:44,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 15:30:44,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:44,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:44,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:44,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297184545] [2025-01-09 15:30:44,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297184545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:44,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:44,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:30:44,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984861556] [2025-01-09 15:30:44,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:44,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:30:44,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:44,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:30:44,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:30:44,514 INFO L87 Difference]: Start difference. First operand 1300 states and 1756 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:44,569 INFO L93 Difference]: Finished difference Result 2540 states and 3423 transitions. [2025-01-09 15:30:44,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:30:44,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2025-01-09 15:30:44,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:44,574 INFO L225 Difference]: With dead ends: 2540 [2025-01-09 15:30:44,574 INFO L226 Difference]: Without dead ends: 1278 [2025-01-09 15:30:44,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:30:44,576 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:44,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:30:44,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2025-01-09 15:30:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1278. [2025-01-09 15:30:44,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 1097 states have (on average 1.276207839562443) internal successors, (1400), 1103 states have internal predecessors, (1400), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2025-01-09 15:30:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1712 transitions. [2025-01-09 15:30:44,643 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1712 transitions. Word has length 139 [2025-01-09 15:30:44,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:44,643 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1712 transitions. [2025-01-09 15:30:44,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1712 transitions. [2025-01-09 15:30:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 15:30:44,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:44,646 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:44,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 15:30:44,646 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:44,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:44,646 INFO L85 PathProgramCache]: Analyzing trace with hash -981684742, now seen corresponding path program 1 times [2025-01-09 15:30:44,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:44,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529990718] [2025-01-09 15:30:44,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:44,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:44,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 15:30:44,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 15:30:44,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:44,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:45,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:45,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529990718] [2025-01-09 15:30:45,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529990718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:45,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:45,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:30:45,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816697819] [2025-01-09 15:30:45,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:45,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:30:45,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:45,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:30:45,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:30:45,007 INFO L87 Difference]: Start difference. First operand 1278 states and 1712 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:45,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:45,417 INFO L93 Difference]: Finished difference Result 1631 states and 2178 transitions. [2025-01-09 15:30:45,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:30:45,418 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 140 [2025-01-09 15:30:45,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:45,422 INFO L225 Difference]: With dead ends: 1631 [2025-01-09 15:30:45,422 INFO L226 Difference]: Without dead ends: 1369 [2025-01-09 15:30:45,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:30:45,423 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 454 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:45,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1414 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:30:45,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2025-01-09 15:30:45,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1270. [2025-01-09 15:30:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1089 states have (on average 1.278236914600551) internal successors, (1392), 1095 states have internal predecessors, (1392), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2025-01-09 15:30:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1704 transitions. [2025-01-09 15:30:45,482 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1704 transitions. Word has length 140 [2025-01-09 15:30:45,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:45,482 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1704 transitions. [2025-01-09 15:30:45,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:45,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1704 transitions. [2025-01-09 15:30:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 15:30:45,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:45,484 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:45,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 15:30:45,484 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:45,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:45,485 INFO L85 PathProgramCache]: Analyzing trace with hash 21417596, now seen corresponding path program 1 times [2025-01-09 15:30:45,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:45,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223808840] [2025-01-09 15:30:45,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:45,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:45,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 15:30:45,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 15:30:45,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:45,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:45,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:45,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223808840] [2025-01-09 15:30:45,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223808840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:45,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:45,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:30:45,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349590976] [2025-01-09 15:30:45,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:45,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:30:45,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:45,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:30:45,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:30:45,780 INFO L87 Difference]: Start difference. First operand 1270 states and 1704 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:46,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:46,015 INFO L93 Difference]: Finished difference Result 2197 states and 2930 transitions. [2025-01-09 15:30:46,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:30:46,015 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 140 [2025-01-09 15:30:46,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:46,022 INFO L225 Difference]: With dead ends: 2197 [2025-01-09 15:30:46,024 INFO L226 Difference]: Without dead ends: 1253 [2025-01-09 15:30:46,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:30:46,026 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 373 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:46,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 780 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:30:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2025-01-09 15:30:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 797. [2025-01-09 15:30:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 686 states have (on average 1.271137026239067) internal successors, (872), 688 states have internal predecessors, (872), 93 states have call successors, (93), 17 states have call predecessors, (93), 17 states have return successors, (93), 91 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 15:30:46,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1058 transitions. [2025-01-09 15:30:46,070 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1058 transitions. Word has length 140 [2025-01-09 15:30:46,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:46,071 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1058 transitions. [2025-01-09 15:30:46,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:46,071 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1058 transitions. [2025-01-09 15:30:46,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:30:46,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:46,073 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:46,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 15:30:46,073 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:46,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:46,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2065374844, now seen corresponding path program 1 times [2025-01-09 15:30:46,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:46,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221293915] [2025-01-09 15:30:46,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:46,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:46,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:30:46,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:30:46,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:46,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:46,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:46,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221293915] [2025-01-09 15:30:46,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221293915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:46,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:46,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:30:46,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866785819] [2025-01-09 15:30:46,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:46,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:30:46,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:46,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:30:46,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:30:46,181 INFO L87 Difference]: Start difference. First operand 797 states and 1058 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:46,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:46,249 INFO L93 Difference]: Finished difference Result 1614 states and 2131 transitions. [2025-01-09 15:30:46,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:30:46,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 141 [2025-01-09 15:30:46,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:46,252 INFO L225 Difference]: With dead ends: 1614 [2025-01-09 15:30:46,252 INFO L226 Difference]: Without dead ends: 855 [2025-01-09 15:30:46,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:30:46,254 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 34 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:46,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 563 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:30:46,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-01-09 15:30:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 811. [2025-01-09 15:30:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 700 states have (on average 1.26) internal successors, (882), 702 states have internal predecessors, (882), 93 states have call successors, (93), 17 states have call predecessors, (93), 17 states have return successors, (93), 91 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 15:30:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1068 transitions. [2025-01-09 15:30:46,296 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1068 transitions. Word has length 141 [2025-01-09 15:30:46,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:46,296 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1068 transitions. [2025-01-09 15:30:46,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1068 transitions. [2025-01-09 15:30:46,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:30:46,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:46,297 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:46,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 15:30:46,297 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:46,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:46,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1478568830, now seen corresponding path program 1 times [2025-01-09 15:30:46,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:46,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004143850] [2025-01-09 15:30:46,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:46,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:46,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:30:46,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:30:46,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:46,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:46,469 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:46,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:46,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004143850] [2025-01-09 15:30:46,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004143850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:46,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:46,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:30:46,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226126774] [2025-01-09 15:30:46,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:46,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:30:46,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:46,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:30:46,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:30:46,470 INFO L87 Difference]: Start difference. First operand 811 states and 1068 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:46,615 INFO L93 Difference]: Finished difference Result 1905 states and 2490 transitions. [2025-01-09 15:30:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:30:46,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 141 [2025-01-09 15:30:46,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:46,622 INFO L225 Difference]: With dead ends: 1905 [2025-01-09 15:30:46,624 INFO L226 Difference]: Without dead ends: 1132 [2025-01-09 15:30:46,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:30:46,626 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 80 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:46,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 667 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:30:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2025-01-09 15:30:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 921. [2025-01-09 15:30:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 810 states have (on average 1.2271604938271605) internal successors, (994), 812 states have internal predecessors, (994), 93 states have call successors, (93), 17 states have call predecessors, (93), 17 states have return successors, (93), 91 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 15:30:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1180 transitions. [2025-01-09 15:30:46,677 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1180 transitions. Word has length 141 [2025-01-09 15:30:46,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:46,678 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1180 transitions. [2025-01-09 15:30:46,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:46,678 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1180 transitions. [2025-01-09 15:30:46,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 15:30:46,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:46,679 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:46,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 15:30:46,679 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:46,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:46,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2030477266, now seen corresponding path program 1 times [2025-01-09 15:30:46,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:46,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702351068] [2025-01-09 15:30:46,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:46,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:46,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:30:46,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:30:46,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:46,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:30:46,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:46,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702351068] [2025-01-09 15:30:46,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702351068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:46,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:46,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:30:46,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946019372] [2025-01-09 15:30:46,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:46,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:30:46,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:46,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:30:46,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:30:46,889 INFO L87 Difference]: Start difference. First operand 921 states and 1180 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:47,005 INFO L93 Difference]: Finished difference Result 947 states and 1210 transitions. [2025-01-09 15:30:47,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:30:47,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2025-01-09 15:30:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:47,008 INFO L225 Difference]: With dead ends: 947 [2025-01-09 15:30:47,008 INFO L226 Difference]: Without dead ends: 945 [2025-01-09 15:30:47,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:30:47,009 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 121 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:47,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1240 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:30:47,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-01-09 15:30:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 943. [2025-01-09 15:30:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 832 states have (on average 1.2211538461538463) internal successors, (1016), 834 states have internal predecessors, (1016), 93 states have call successors, (93), 17 states have call predecessors, (93), 17 states have return successors, (93), 91 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 15:30:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1202 transitions. [2025-01-09 15:30:47,096 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1202 transitions. Word has length 142 [2025-01-09 15:30:47,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:47,096 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1202 transitions. [2025-01-09 15:30:47,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:30:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1202 transitions. [2025-01-09 15:30:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 15:30:47,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:47,098 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:47,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 15:30:47,098 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:47,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1958090708, now seen corresponding path program 1 times [2025-01-09 15:30:47,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:47,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216708316] [2025-01-09 15:30:47,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:47,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:47,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:30:47,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:30:47,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:47,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:30:47,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858945835] [2025-01-09 15:30:47,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:47,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:30:47,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:30:47,166 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:30:47,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 15:30:47,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:30:47,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:30:47,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:47,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:47,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-01-09 15:30:47,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:30:48,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:30:49,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 15:30:49,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-01-09 15:30:50,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:30:50,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-01-09 15:30:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 101 proven. 225 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 15:30:51,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:30:51,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:30:51,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216708316] [2025-01-09 15:30:51,573 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:30:51,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858945835] [2025-01-09 15:30:51,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858945835] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:30:51,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:30:51,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2025-01-09 15:30:51,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179497982] [2025-01-09 15:30:51,574 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 15:30:51,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:30:51,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:30:51,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:30:51,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2025-01-09 15:30:51,574 INFO L87 Difference]: Start difference. First operand 943 states and 1202 transitions. Second operand has 15 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2025-01-09 15:30:52,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:52,875 INFO L93 Difference]: Finished difference Result 1892 states and 2392 transitions. [2025-01-09 15:30:52,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 15:30:52,875 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) Word has length 142 [2025-01-09 15:30:52,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:52,878 INFO L225 Difference]: With dead ends: 1892 [2025-01-09 15:30:52,878 INFO L226 Difference]: Without dead ends: 987 [2025-01-09 15:30:52,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=226, Invalid=1414, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 15:30:52,882 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 285 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:52,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1475 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:30:52,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2025-01-09 15:30:52,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 699. [2025-01-09 15:30:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 622 states have (on average 1.2057877813504823) internal successors, (750), 622 states have internal predecessors, (750), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 15:30:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 870 transitions. [2025-01-09 15:30:52,972 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 870 transitions. Word has length 142 [2025-01-09 15:30:52,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:52,972 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 870 transitions. [2025-01-09 15:30:52,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2025-01-09 15:30:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 870 transitions. [2025-01-09 15:30:52,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 15:30:52,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:52,973 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:53,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 15:30:53,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-01-09 15:30:53,181 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:53,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:53,182 INFO L85 PathProgramCache]: Analyzing trace with hash -545527088, now seen corresponding path program 1 times [2025-01-09 15:30:53,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:30:53,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134074481] [2025-01-09 15:30:53,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:53,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:30:53,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:30:53,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:30:53,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:53,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:30:53,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [388415904] [2025-01-09 15:30:53,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:53,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:30:53,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:30:53,272 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:30:53,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 15:30:53,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:30:53,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:30:53,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:53,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:30:53,571 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:30:53,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:30:53,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:30:53,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:53,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:30:53,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:30:53,812 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:30:53,813 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:30:53,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 15:30:54,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-01-09 15:30:54,018 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:30:54,170 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:30:54,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:30:54 BoogieIcfgContainer [2025-01-09 15:30:54,172 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:30:54,173 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:30:54,173 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:30:54,173 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:30:54,173 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:30:27" (3/4) ... [2025-01-09 15:30:54,175 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:30:54,175 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:30:54,176 INFO L158 Benchmark]: Toolchain (without parser) took 27356.76ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 111.5MB in the beginning and 135.0MB in the end (delta: -23.5MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2025-01-09 15:30:54,177 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 209.7MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:30:54,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.47ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 96.3MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:30:54,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.26ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 93.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:30:54,178 INFO L158 Benchmark]: Boogie Preprocessor took 65.98ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 88.7MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:30:54,178 INFO L158 Benchmark]: RCFGBuilder took 514.83ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 53.7MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:30:54,179 INFO L158 Benchmark]: TraceAbstraction took 26473.16ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 53.7MB in the beginning and 135.0MB in the end (delta: -81.4MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2025-01-09 15:30:54,179 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 201.3MB. Free memory was 135.0MB in the beginning and 135.0MB in the end (delta: 55.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:30:54,180 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.68ms. Allocated memory is still 209.7MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.47ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 96.3MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.26ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 93.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.98ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 88.7MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 514.83ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 53.7MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 26473.16ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 53.7MB in the beginning and 135.0MB in the end (delta: -81.4MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 201.3MB. Free memory was 135.0MB in the beginning and 135.0MB in the end (delta: 55.4kB). 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 someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26-L28] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L26-L28] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L26-L28] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L26-L28] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L26-L28] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L29] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0][0]); [L30] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1][0]); [L31] double* double_Array_0_arraydouble_Array_0arrayVar2_Pointer = &(double_Array_0[0][1]); [L32] double* double_Array_0_arraydouble_Array_0arrayVar3_Pointer = &(double_Array_0[1][1]); [L33-L35] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L33-L35] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L33-L35] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L33-L35] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L33-L35] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L36] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0][0]); [L37] signed char* signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer = &(signed_char_Array_0[1][0]); [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer = &(signed_char_Array_0[0][1]); [L39] signed char* signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer = &(signed_char_Array_0[1][1]); [L40-L42] unsigned char unsigned_char_Array_0[1] = { 16 }; [L40-L42] unsigned char unsigned_char_Array_0[1] = { 16 }; [L43] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L44-L46] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L44-L46] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L44-L46] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L44-L46] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L47] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0]); [L48] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1]); [L49] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer = &(unsigned_short_int_Array_0[2]); VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L107] isInitial = 1 [L108] FCALL initially() [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L78] double_Array_0[0][0] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[0][0] [L79] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L79] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F [L79] EXPR double_Array_0[0][0] [L79] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L79] EXPR (double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L79] EXPR (double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L79] CALL assume_abort_if_not((double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L79] RET assume_abort_if_not((double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L80] double_Array_0[1][0] = __VERIFIER_nondet_double() [L81] EXPR double_Array_0[1][0] [L81] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L81] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F [L81] EXPR double_Array_0[1][0] [L81] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L81] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L81] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L81] CALL assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L81] RET assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L82] double_Array_0[0][1] = __VERIFIER_nondet_double() [L83] EXPR double_Array_0[0][1] [L83] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L83] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F [L83] EXPR double_Array_0[0][1] [L83] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L83] EXPR (double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L83] EXPR (double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L83] CALL assume_abort_if_not((double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L83] RET assume_abort_if_not((double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L84] double_Array_0[1][1] = __VERIFIER_nondet_double() [L85] EXPR double_Array_0[1][1] [L85] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L85] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F [L85] EXPR double_Array_0[1][1] [L85] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L85] EXPR (double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L85] EXPR (double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L85] CALL assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L85] RET assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L86] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L87] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][0] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L88] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L88] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L88] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L89] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L90] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L90] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L90] RET assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L91] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L91] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L91] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L92] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L93] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L93] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L93] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L94] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L94] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L94] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L95] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L96] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L96] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L96] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L97] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L97] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L97] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L98] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L98] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L98] RET assume_abort_if_not(unsigned_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L111] RET updateVariables() [L112] CALL step() [L53] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L53] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L53] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L53] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L53] EXPR ((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) [L53] EXPR ((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L53] COND FALSE !((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) <= (256.625 * ((((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))))) [L56] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L56] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) [L59] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L59] ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L59] ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) [L59] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L59] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L59] ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L59] COND FALSE !(((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) [L62] (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) = 5 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L64] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L64] unsigned char stepLocal_1 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)); [L65] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L65] unsigned char stepLocal_0 = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)); [L66] stepLocal_0 || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, stepLocal_1=16, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L66] stepLocal_0 || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) [L66] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L66] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L66] stepLocal_0 || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, stepLocal_1=16, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L66] COND TRUE stepLocal_0 || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) [L67] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L67] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L67] COND FALSE !(stepLocal_1 < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1 [L103] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5))) [L103] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L103] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) [L103] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L103] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L103] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)) [L103] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer) [L103] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) [L103] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L103] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) [L103] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L103] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L103] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) [L103] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L103] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L103] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1 [L103] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))))) && (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) <= (256.625 * ((((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))))) && (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) <= (256.625 * ((((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) [L103] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L103] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L103] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L103] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) [L103] EXPR ((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) <= (256.625 * ((((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 [L103] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L103] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) <= (256.625 * ((((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))))) && (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) <= (256.625 * ((((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103-L104] return ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))))) && (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) <= (256.625 * ((((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.3s, OverallIterations: 35, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5665 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5654 mSDsluCounter, 30303 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23241 mSDsCounter, 479 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5865 IncrementalHoareTripleChecker+Invalid, 6344 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 479 mSolverCounterUnsat, 7062 mSDtfsCounter, 5865 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 878 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1300occurred in iteration=27, InterpolantAutomatonStates: 239, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 3385 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 5452 NumberOfCodeBlocks, 5452 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 4989 ConstructedInterpolants, 0 QuantifiedInterpolants, 22114 SizeOfPredicates, 13 NumberOfNonLiveVariables, 2032 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 37 InterpolantComputations, 33 PerfectInterpolantSequences, 15203/15540 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-01-09 15:30:54,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-13.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ab1505ae670373b6c322e0c16a487a3f348c7a8c6cd3865cdae18d40153ca8fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:30:56,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:30:56,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:30:56,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:30:56,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:30:56,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:30:56,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:30:56,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:30:56,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:30:56,161 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:30:56,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:30:56,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:30:56,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:30:56,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:30:56,162 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:30:56,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:30:56,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:30:56,162 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:30:56,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:30:56,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:30:56,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:30:56,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:30:56,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:30:56,162 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:30:56,162 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:30:56,163 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:30:56,163 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:30:56,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:30:56,163 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:30:56,163 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:30:56,163 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:30:56,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:30:56,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:30:56,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:30:56,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:30:56,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:30:56,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:30:56,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:30:56,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:30:56,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:30:56,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:30:56,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:30:56,165 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:30:56,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:30:56,165 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:30:56,165 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:30:56,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:30:56,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:30:56,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:30:56,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:30:56,165 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-jdk21/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 -> ab1505ae670373b6c322e0c16a487a3f348c7a8c6cd3865cdae18d40153ca8fc [2025-01-09 15:30:56,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:30:56,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:30:56,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:30:56,403 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:30:56,404 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:30:56,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-13.i [2025-01-09 15:30:57,545 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54720b1be/86766bf4ba1c471396f9ef6916129df3/FLAG531a57ab4 [2025-01-09 15:30:57,811 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:30:57,811 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-13.i [2025-01-09 15:30:57,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54720b1be/86766bf4ba1c471396f9ef6916129df3/FLAG531a57ab4 [2025-01-09 15:30:58,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54720b1be/86766bf4ba1c471396f9ef6916129df3 [2025-01-09 15:30:58,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:30:58,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:30:58,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:30:58,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:30:58,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:30:58,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:30:58" (1/1) ... [2025-01-09 15:30:58,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c76904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:58, skipping insertion in model container [2025-01-09 15:30:58,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:30:58" (1/1) ... [2025-01-09 15:30:58,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:30:58,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-13.i[917,930] [2025-01-09 15:30:58,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:30:58,346 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:30:58,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-13.i[917,930] [2025-01-09 15:30:58,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:30:58,399 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:30:58,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:58 WrapperNode [2025-01-09 15:30:58,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:30:58,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:30:58,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:30:58,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:30:58,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:58" (1/1) ... [2025-01-09 15:30:58,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:58" (1/1) ... [2025-01-09 15:30:58,448 INFO L138 Inliner]: procedures = 33, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 482 [2025-01-09 15:30:58,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:30:58,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:30:58,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:30:58,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:30:58,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:58" (1/1) ... [2025-01-09 15:30:58,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:58" (1/1) ... [2025-01-09 15:30:58,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:58" (1/1) ... [2025-01-09 15:30:58,473 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 8, 34, 31, 23, 17]. 30 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 4, 4, 1, 3]. The 15 writes are split as follows [0, 1, 4, 5, 1, 4]. [2025-01-09 15:30:58,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:58" (1/1) ... [2025-01-09 15:30:58,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:58" (1/1) ... [2025-01-09 15:30:58,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:58" (1/1) ... [2025-01-09 15:30:58,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:58" (1/1) ... [2025-01-09 15:30:58,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:58" (1/1) ... [2025-01-09 15:30:58,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:58" (1/1) ... [2025-01-09 15:30:58,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:58" (1/1) ... [2025-01-09 15:30:58,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:30:58,499 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:30:58,499 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:30:58,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:30:58,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:58" (1/1) ... [2025-01-09 15:30:58,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:30:58,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:30:58,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:30:58,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:30:58,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:30:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:30:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:30:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:30:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:30:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:30:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-01-09 15:30:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:30:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:30:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:30:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:30:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:30:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-01-09 15:30:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:30:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:30:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:30:58,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:30:58,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:30:58,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:30:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:30:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:30:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:30:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:30:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:30:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-01-09 15:30:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:30:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:30:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:30:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:30:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:30:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:30:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:30:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:30:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:30:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:30:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:30:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-01-09 15:30:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:30:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:30:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:30:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:30:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:30:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-01-09 15:30:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:30:58,572 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:30:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:30:58,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:30:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:30:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:30:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:30:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:30:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:30:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:30:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:30:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:30:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:30:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:30:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:30:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-01-09 15:30:58,720 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:30:58,721 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:31:08,796 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-01-09 15:31:08,797 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:31:08,809 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:31:08,809 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:31:08,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:31:08 BoogieIcfgContainer [2025-01-09 15:31:08,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:31:08,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:31:08,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:31:08,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:31:08,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:30:58" (1/3) ... [2025-01-09 15:31:08,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7585ff8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:31:08, skipping insertion in model container [2025-01-09 15:31:08,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:58" (2/3) ... [2025-01-09 15:31:08,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7585ff8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:31:08, skipping insertion in model container [2025-01-09 15:31:08,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:31:08" (3/3) ... [2025-01-09 15:31:08,819 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-13.i [2025-01-09 15:31:08,844 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:31:08,846 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-13.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:31:08,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:31:08,905 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;@4872b3a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:31:08,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:31:08,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:31:08,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:31:08,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:08,915 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:31:08,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:08,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:08,919 INFO L85 PathProgramCache]: Analyzing trace with hash -773158161, now seen corresponding path program 1 times [2025-01-09 15:31:08,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:31:08,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798343362] [2025-01-09 15:31:08,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:08,927 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-01-09 15:31:08,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:31:08,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 15:31:08,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:31:09,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:31:09,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:31:09,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:09,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:09,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:31:09,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:31:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 15:31:09,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:31:09,429 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:31:09,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798343362] [2025-01-09 15:31:09,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798343362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:09,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:09,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:31:09,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822447402] [2025-01-09 15:31:09,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:09,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:31:09,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:31:09,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:31:09,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:31:09,451 INFO L87 Difference]: Start difference. First operand has 111 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:31:09,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:09,480 INFO L93 Difference]: Finished difference Result 216 states and 338 transitions. [2025-01-09 15:31:09,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:31:09,482 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-01-09 15:31:09,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:09,489 INFO L225 Difference]: With dead ends: 216 [2025-01-09 15:31:09,489 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 15:31:09,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:31:09,495 INFO L435 NwaCegarLoop]: 159 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, 159 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-01-09 15:31:09,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:31:09,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 15:31:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-09 15:31:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:31:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2025-01-09 15:31:09,528 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 131 [2025-01-09 15:31:09,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:09,528 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2025-01-09 15:31:09,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:31:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2025-01-09 15:31:09,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:31:09,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:09,533 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:31:09,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:31:09,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 15:31:09,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:09,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:09,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1631701735, now seen corresponding path program 1 times [2025-01-09 15:31:09,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:31:09,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154139184] [2025-01-09 15:31:09,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:09,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:31:09,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:31:09,738 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 15:31:09,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:31:09,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:31:10,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:31:10,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:10,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:10,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:31:10,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:31:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-09 15:31:10,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:31:10,180 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:31:10,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154139184] [2025-01-09 15:31:10,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154139184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:10,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:10,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:31:10,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867676770] [2025-01-09 15:31:10,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:10,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:31:10,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:31:10,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:31:10,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:31:10,182 INFO L87 Difference]: Start difference. First operand 108 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:31:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:10,255 INFO L93 Difference]: Finished difference Result 215 states and 318 transitions. [2025-01-09 15:31:10,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:31:10,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-01-09 15:31:10,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:10,257 INFO L225 Difference]: With dead ends: 215 [2025-01-09 15:31:10,257 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 15:31:10,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:31:10,258 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:10,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:31:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 15:31:10,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 15:31:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:31:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2025-01-09 15:31:10,272 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 161 transitions. Word has length 131 [2025-01-09 15:31:10,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:10,273 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 161 transitions. [2025-01-09 15:31:10,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:31:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 161 transitions. [2025-01-09 15:31:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:31:10,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:10,275 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:31:10,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-01-09 15:31:10,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 15:31:10,475 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:10,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:10,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1750143209, now seen corresponding path program 1 times [2025-01-09 15:31:10,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:31:10,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006780367] [2025-01-09 15:31:10,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:10,476 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-01-09 15:31:10,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:31:10,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 15:31:10,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:31:10,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:31:10,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:31:10,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:10,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:10,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 15:31:10,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:31:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 95 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 15:31:11,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:31:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:31:11,610 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:31:11,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006780367] [2025-01-09 15:31:11,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006780367] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:31:11,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:31:11,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-01-09 15:31:11,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662130925] [2025-01-09 15:31:11,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:11,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:31:11,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:31:11,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:31:11,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:31:11,617 INFO L87 Difference]: Start difference. First operand 110 states and 161 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:31:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:11,808 INFO L93 Difference]: Finished difference Result 261 states and 384 transitions. [2025-01-09 15:31:11,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:31:11,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-01-09 15:31:11,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:11,810 INFO L225 Difference]: With dead ends: 261 [2025-01-09 15:31:11,810 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 15:31:11,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:31:11,811 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 120 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:11,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 453 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:31:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 15:31:11,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 115. [2025-01-09 15:31:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:31:11,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2025-01-09 15:31:11,820 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 131 [2025-01-09 15:31:11,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:11,820 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2025-01-09 15:31:11,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:31:11,820 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2025-01-09 15:31:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:31:11,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:11,822 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:31:11,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:31:12,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-01-09 15:31:12,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:12,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:12,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1264960409, now seen corresponding path program 1 times [2025-01-09 15:31:12,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:31:12,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755960659] [2025-01-09 15:31:12,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:12,027 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-01-09 15:31:12,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:31:12,030 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-01-09 15:31:12,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:31:12,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:31:12,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:31:12,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:12,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:12,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:31:12,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:31:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:31:12,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:31:12,506 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:31:12,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755960659] [2025-01-09 15:31:12,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755960659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:12,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:12,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:31:12,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420322418] [2025-01-09 15:31:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:12,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:31:12,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:31:12,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:31:12,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:31:12,507 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:31:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:12,540 INFO L93 Difference]: Finished difference Result 229 states and 336 transitions. [2025-01-09 15:31:12,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:31:12,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-01-09 15:31:12,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:12,544 INFO L225 Difference]: With dead ends: 229 [2025-01-09 15:31:12,544 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 15:31:12,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:31:12,545 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 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-01-09 15:31:12,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:31:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 15:31:12,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-01-09 15:31:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:31:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2025-01-09 15:31:12,551 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 131 [2025-01-09 15:31:12,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:12,551 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2025-01-09 15:31:12,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:31:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2025-01-09 15:31:12,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:31:12,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:12,552 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:31:12,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:31:12,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-01-09 15:31:12,756 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:12,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:12,756 INFO L85 PathProgramCache]: Analyzing trace with hash -518483020, now seen corresponding path program 1 times [2025-01-09 15:31:12,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:31:12,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984574689] [2025-01-09 15:31:12,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:12,757 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-01-09 15:31:12,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:31:12,760 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-01-09 15:31:12,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:31:12,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:31:13,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:31:13,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:13,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:13,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:31:13,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:31:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 95 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 15:31:13,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:31:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:31:14,083 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:31:14,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984574689] [2025-01-09 15:31:14,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984574689] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:31:14,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:31:14,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-01-09 15:31:14,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096914257] [2025-01-09 15:31:14,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:14,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:31:14,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:31:14,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:31:14,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:31:14,086 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:31:14,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:14,196 INFO L93 Difference]: Finished difference Result 268 states and 390 transitions. [2025-01-09 15:31:14,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:31:14,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2025-01-09 15:31:14,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:14,198 INFO L225 Difference]: With dead ends: 268 [2025-01-09 15:31:14,198 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 15:31:14,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:31:14,199 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 102 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:14,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 454 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:31:14,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 15:31:14,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 125. [2025-01-09 15:31:14,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:31:14,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 182 transitions. [2025-01-09 15:31:14,214 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 182 transitions. Word has length 133 [2025-01-09 15:31:14,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:14,215 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 182 transitions. [2025-01-09 15:31:14,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:31:14,215 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 182 transitions. [2025-01-09 15:31:14,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:31:14,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:14,216 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:31:14,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:31:14,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/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-01-09 15:31:14,417 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:14,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:14,417 INFO L85 PathProgramCache]: Analyzing trace with hash 489045141, now seen corresponding path program 1 times [2025-01-09 15:31:14,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:31:14,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68453684] [2025-01-09 15:31:14,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:14,418 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-01-09 15:31:14,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:31:14,421 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/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-01-09 15:31:14,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:31:14,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:31:14,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:31:14,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:14,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:14,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:31:14,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:31:14,957 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:31:14,957 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:31:14,957 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:31:14,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68453684] [2025-01-09 15:31:14,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68453684] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:14,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:14,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:31:14,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163043520] [2025-01-09 15:31:14,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:14,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:31:14,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:31:14,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:31:14,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:31:14,958 INFO L87 Difference]: Start difference. First operand 125 states and 182 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:31:15,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:15,236 INFO L93 Difference]: Finished difference Result 353 states and 516 transitions. [2025-01-09 15:31:15,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:31:15,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-01-09 15:31:15,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:15,238 INFO L225 Difference]: With dead ends: 353 [2025-01-09 15:31:15,238 INFO L226 Difference]: Without dead ends: 231 [2025-01-09 15:31:15,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:31:15,239 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 121 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:15,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 765 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:31:15,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-01-09 15:31:15,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 220. [2025-01-09 15:31:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 190 states have (on average 1.3894736842105264) internal successors, (264), 191 states have internal predecessors, (264), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 15:31:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 318 transitions. [2025-01-09 15:31:15,248 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 318 transitions. Word has length 134 [2025-01-09 15:31:15,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:15,249 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 318 transitions. [2025-01-09 15:31:15,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:31:15,249 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 318 transitions. [2025-01-09 15:31:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:31:15,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:15,250 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:31:15,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-01-09 15:31:15,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/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-01-09 15:31:15,454 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:15,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:15,454 INFO L85 PathProgramCache]: Analyzing trace with hash -212019437, now seen corresponding path program 1 times [2025-01-09 15:31:15,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:31:15,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011450472] [2025-01-09 15:31:15,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:15,455 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-01-09 15:31:15,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:31:15,458 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/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-01-09 15:31:15,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 15:31:15,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:31:15,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:31:15,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:15,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:15,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:31:15,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:31:15,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:31:15,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2025-01-09 15:31:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-01-09 15:31:16,006 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:31:16,007 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:31:16,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011450472] [2025-01-09 15:31:16,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011450472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:16,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:16,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:31:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669963515] [2025-01-09 15:31:16,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:16,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:31:16,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:31:16,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:31:16,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:31:16,008 INFO L87 Difference]: Start difference. First operand 220 states and 318 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:31:18,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:31:21,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:31:24,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:31:27,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:31:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:27,635 INFO L93 Difference]: Finished difference Result 439 states and 635 transitions. [2025-01-09 15:31:27,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:31:27,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-01-09 15:31:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:27,657 INFO L225 Difference]: With dead ends: 439 [2025-01-09 15:31:27,657 INFO L226 Difference]: Without dead ends: 222 [2025-01-09 15:31:27,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:31:27,661 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 144 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:27,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 489 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2025-01-09 15:31:27,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-01-09 15:31:27,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2025-01-09 15:31:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 190 states have (on average 1.3789473684210527) internal successors, (262), 191 states have internal predecessors, (262), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 15:31:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 316 transitions. [2025-01-09 15:31:27,679 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 316 transitions. Word has length 134 [2025-01-09 15:31:27,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:27,681 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 316 transitions. [2025-01-09 15:31:27,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:31:27,681 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 316 transitions. [2025-01-09 15:31:27,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 15:31:27,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:27,682 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:31:27,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 15:31:27,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/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-01-09 15:31:27,886 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:27,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:27,887 INFO L85 PathProgramCache]: Analyzing trace with hash -216403335, now seen corresponding path program 1 times [2025-01-09 15:31:27,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:31:27,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134521449] [2025-01-09 15:31:27,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:27,887 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-01-09 15:31:27,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:31:27,889 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/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-01-09 15:31:27,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-01-09 15:31:27,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 15:31:28,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 15:31:28,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:28,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:28,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:31:28,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:31:28,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:31:28,482 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-01-09 15:31:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-09 15:31:28,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:31:28,518 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:31:28,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134521449] [2025-01-09 15:31:28,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134521449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:31:28,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:31:28,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:31:28,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678215532] [2025-01-09 15:31:28,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:31:28,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:31:28,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:31:28,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:31:28,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:31:28,520 INFO L87 Difference]: Start difference. First operand 220 states and 316 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:31:31,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:31:34,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:31:36,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:31:38,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:31:38,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:31:38,721 INFO L93 Difference]: Finished difference Result 437 states and 629 transitions. [2025-01-09 15:31:38,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:31:38,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-01-09 15:31:38,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:31:38,741 INFO L225 Difference]: With dead ends: 437 [2025-01-09 15:31:38,741 INFO L226 Difference]: Without dead ends: 220 [2025-01-09 15:31:38,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:31:38,741 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 136 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:31:38,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 485 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2025-01-09 15:31:38,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-09 15:31:38,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2025-01-09 15:31:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 186 states have (on average 1.3763440860215055) internal successors, (256), 187 states have internal predecessors, (256), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 15:31:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 310 transitions. [2025-01-09 15:31:38,749 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 310 transitions. Word has length 136 [2025-01-09 15:31:38,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:31:38,749 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 310 transitions. [2025-01-09 15:31:38,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:31:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 310 transitions. [2025-01-09 15:31:38,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 15:31:38,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:31:38,751 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:31:38,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-01-09 15:31:38,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/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-01-09 15:31:38,955 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:31:38,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:31:38,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1732168337, now seen corresponding path program 1 times [2025-01-09 15:31:38,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:31:38,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561961616] [2025-01-09 15:31:38,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:31:38,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:31:38,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:31:38,964 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/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-01-09 15:31:38,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-01-09 15:31:39,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 15:31:39,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 15:31:39,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:31:39,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:31:39,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:31:39,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:31:39,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:31:39,656 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 172 treesize of output 64 [2025-01-09 15:31:39,730 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 176 proven. 12 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-01-09 15:31:39,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:31:40,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:31:40,020 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 110 treesize of output 1 [2025-01-09 15:31:40,035 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 15:31:40,035 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:31:40,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561961616] [2025-01-09 15:31:40,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561961616] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:31:40,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:31:40,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-01-09 15:31:40,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556879488] [2025-01-09 15:31:40,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:31:40,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:31:40,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:31:40,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:31:40,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:31:40,037 INFO L87 Difference]: Start difference. First operand 216 states and 310 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2025-01-09 15:31:43,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:31:47,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:31:49,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:31:52,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []