./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/ludcmp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/loops/ludcmp.c -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 45bf8892eb23096ca55c36a274511a87f80900e96066e62793920cbba0252ec0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:12:24,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:12:24,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:12:24,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:12:24,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:12:24,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:12:24,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:12:24,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:12:24,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:12:24,155 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:12:24,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:12:24,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:12:24,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:12:24,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:12:24,155 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:12:24,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:12:24,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:12:24,156 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:12:24,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:12:24,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:12:24,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:12:24,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:12:24,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:12:24,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:12:24,157 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:12:24,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:12:24,157 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:12:24,157 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:12:24,157 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:12:24,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:12:24,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:12:24,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:12:24,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:12:24,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:12:24,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:12:24,158 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:12:24,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:12:24,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:12:24,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:12:24,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:12:24,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:12:24,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:12:24,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:12:24,158 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 -> 45bf8892eb23096ca55c36a274511a87f80900e96066e62793920cbba0252ec0 [2025-02-07 20:12:24,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:12:24,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:12:24,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:12:24,468 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:12:24,468 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:12:24,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/ludcmp.c [2025-02-07 20:12:25,805 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ad96305b/628a8ebe06f3493d8634e15e0ae6dab4/FLAG2c8b4516c [2025-02-07 20:12:26,080 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:12:26,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/ludcmp.c [2025-02-07 20:12:26,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ad96305b/628a8ebe06f3493d8634e15e0ae6dab4/FLAG2c8b4516c [2025-02-07 20:12:26,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ad96305b/628a8ebe06f3493d8634e15e0ae6dab4 [2025-02-07 20:12:26,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:12:26,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:12:26,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:12:26,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:12:26,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:12:26,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:12:26" (1/1) ... [2025-02-07 20:12:26,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebc28ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:26, skipping insertion in model container [2025-02-07 20:12:26,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:12:26" (1/1) ... [2025-02-07 20:12:26,142 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:12:26,276 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/loops/ludcmp.c[318,331] [2025-02-07 20:12:26,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:12:26,443 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:12:26,451 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/loops/ludcmp.c[318,331] [2025-02-07 20:12:26,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:12:26,648 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:12:26,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:26 WrapperNode [2025-02-07 20:12:26,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:12:26,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:12:26,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:12:26,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:12:26,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:26" (1/1) ... [2025-02-07 20:12:26,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:26" (1/1) ... [2025-02-07 20:12:26,828 INFO L138 Inliner]: procedures = 18, calls = 2647, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 2778 [2025-02-07 20:12:26,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:12:26,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:12:26,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:12:26,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:12:26,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:26" (1/1) ... [2025-02-07 20:12:26,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:26" (1/1) ... [2025-02-07 20:12:26,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:26" (1/1) ... [2025-02-07 20:12:26,937 INFO L175 MemorySlicer]: Split 2631 memory accesses to 5 slices as follows [2, 2518, 53, 5, 53]. 96 percent of accesses are in the largest equivalence class. The 2602 initializations are split as follows [2, 2500, 50, 0, 50]. The 9 writes are split as follows [0, 4, 1, 2, 2]. [2025-02-07 20:12:26,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:26" (1/1) ... [2025-02-07 20:12:26,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:26" (1/1) ... [2025-02-07 20:12:27,023 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:26" (1/1) ... [2025-02-07 20:12:27,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:26" (1/1) ... [2025-02-07 20:12:27,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:26" (1/1) ... [2025-02-07 20:12:27,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:26" (1/1) ... [2025-02-07 20:12:27,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:12:27,060 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:12:27,061 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:12:27,061 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:12:27,062 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:26" (1/1) ... [2025-02-07 20:12:27,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:12:27,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:12:27,098 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-02-07 20:12:27,105 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-02-07 20:12:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:12:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:12:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:12:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 20:12:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 20:12:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 20:12:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 20:12:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-07 20:12:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-07 20:12:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-07 20:12:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-07 20:12:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-07 20:12:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-07 20:12:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-07 20:12:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-07 20:12:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-07 20:12:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-07 20:12:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:12:27,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:12:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-07 20:12:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-07 20:12:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-07 20:12:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-07 20:12:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-07 20:12:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:12:27,266 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:12:27,268 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:12:29,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: assume 0 != ludcmp_~i~1#1;ludcmp_~k~0#1 := 0; [2025-02-07 20:12:29,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: assume !(0 != ludcmp_~i~1#1); [2025-02-07 20:12:29,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-1: assume ~someBinaryDOUBLEComparisonOperation(ludcmp_#t~ret10#1, ludcmp_~eps#1);havoc ludcmp_#t~mem9#1;havoc ludcmp_#t~ret10#1;ludcmp_#res#1 := 1;call ULTIMATE.dealloc(ludcmp_~#y~0#1.base, ludcmp_~#y~0#1.offset);havoc ludcmp_~#y~0#1.base, ludcmp_~#y~0#1.offset; [2025-02-07 20:12:29,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-1: assume !~someBinaryDOUBLEComparisonOperation(ludcmp_#t~ret10#1, ludcmp_~eps#1);havoc ludcmp_#t~mem9#1;havoc ludcmp_#t~ret10#1;ludcmp_~j~1#1 := 1 + ludcmp_~i~1#1; [2025-02-07 20:12:29,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-2: ludcmp_#t~ret10#1 := fabs_#res#1;havoc fabs_~n#1, fabs_~f~0#1;havoc fabs_#in~n#1;assume { :end_inline_fabs } true; [2025-02-07 20:12:29,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;call write~real#2(main_~w~0#1, ~#b~0.base, ~#b~0.offset + 8 * main_~i~0#1, 8);main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; [2025-02-07 20:12:29,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: assume ludcmp_~j~1#1 <= ludcmp_~n#1;call ludcmp_#t~mem17#1 := read~real#1(~#a~0.base, ~#a~0.offset + 400 * (1 + ludcmp_~i~1#1) + 8 * ludcmp_~j~1#1, 8);ludcmp_~w~1#1 := ludcmp_#t~mem17#1;havoc ludcmp_#t~mem17#1;ludcmp_~k~0#1 := 0; [2025-02-07 20:12:29,915 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: assume !(ludcmp_~j~1#1 <= ludcmp_~n#1);ludcmp_#t~post22#1 := ludcmp_~i~1#1;ludcmp_~i~1#1 := 1 + ludcmp_#t~post22#1;havoc ludcmp_#t~post22#1; [2025-02-07 20:12:29,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: call ludcmp_#t~mem15#1 := read~real#1(~#a~0.base, ~#a~0.offset + 400 * ludcmp_~i~1#1 + 8 * ludcmp_~i~1#1, 8);call write~real#1(~someBinaryArithmeticDOUBLEoperation(ludcmp_~w~1#1, ludcmp_#t~mem15#1), ~#a~0.base, ~#a~0.offset + 400 * ludcmp_~j~1#1 + 8 * ludcmp_~i~1#1, 8);havoc ludcmp_#t~mem15#1;ludcmp_#t~post16#1 := ludcmp_~j~1#1;ludcmp_~j~1#1 := 1 + ludcmp_#t~post16#1;havoc ludcmp_#t~post16#1; [2025-02-07 20:12:29,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: assume ludcmp_~k~0#1 < ludcmp_~i~1#1;call ludcmp_#t~mem12#1 := read~real#1(~#a~0.base, ~#a~0.offset + 400 * ludcmp_~j~1#1 + 8 * ludcmp_~k~0#1, 8);call ludcmp_#t~mem13#1 := read~real#1(~#a~0.base, ~#a~0.offset + 400 * ludcmp_~k~0#1 + 8 * ludcmp_~i~1#1, 8);ludcmp_~w~1#1 := ~someBinaryArithmeticDOUBLEoperation(ludcmp_~w~1#1, ~someBinaryArithmeticDOUBLEoperation(ludcmp_#t~mem12#1, ludcmp_#t~mem13#1));ludcmp_#t~post14#1 := ludcmp_~k~0#1;ludcmp_~k~0#1 := 1 + ludcmp_#t~post14#1;havoc ludcmp_#t~post14#1; [2025-02-07 20:12:29,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: assume !(ludcmp_~k~0#1 < ludcmp_~i~1#1); [2025-02-07 20:12:29,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: assume ludcmp_~j~1#1 <= ludcmp_~n#1;call ludcmp_#t~mem11#1 := read~real#1(~#a~0.base, ~#a~0.offset + 400 * ludcmp_~j~1#1 + 8 * ludcmp_~i~1#1, 8);ludcmp_~w~1#1 := ludcmp_#t~mem11#1;havoc ludcmp_#t~mem11#1; [2025-02-07 20:12:29,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: assume !(ludcmp_~j~1#1 <= ludcmp_~n#1);ludcmp_~j~1#1 := 1 + ludcmp_~i~1#1; [2025-02-07 20:12:29,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: call ULTIMATE.dealloc(ludcmp_~#y~0#1.base, ludcmp_~#y~0#1.offset);havoc ludcmp_~#y~0#1.base, ludcmp_~#y~0#1.offset; [2025-02-07 20:12:29,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132: assume ludcmp_~k~0#1 <= ludcmp_~i~1#1;call ludcmp_#t~mem18#1 := read~real#1(~#a~0.base, ~#a~0.offset + 400 * (1 + ludcmp_~i~1#1) + 8 * ludcmp_~k~0#1, 8);call ludcmp_#t~mem19#1 := read~real#1(~#a~0.base, ~#a~0.offset + 400 * ludcmp_~k~0#1 + 8 * ludcmp_~j~1#1, 8);ludcmp_~w~1#1 := ~someBinaryArithmeticDOUBLEoperation(ludcmp_~w~1#1, ~someBinaryArithmeticDOUBLEoperation(ludcmp_#t~mem18#1, ludcmp_#t~mem19#1));ludcmp_#t~post20#1 := ludcmp_~k~0#1;ludcmp_~k~0#1 := 1 + ludcmp_#t~post20#1;havoc ludcmp_#t~post20#1; [2025-02-07 20:12:29,917 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132: assume !(ludcmp_~k~0#1 <= ludcmp_~i~1#1);call write~real#1(ludcmp_~w~1#1, ~#a~0.base, ~#a~0.offset + 400 * (1 + ludcmp_~i~1#1) + 8 * ludcmp_~j~1#1, 8);ludcmp_#t~post21#1 := ludcmp_~j~1#1;ludcmp_~j~1#1 := 1 + ludcmp_#t~post21#1;havoc ludcmp_#t~post21#1; [2025-02-07 20:12:29,927 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-02-07 20:12:29,928 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:12:29,937 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:12:29,938 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:12:29,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:12:29 BoogieIcfgContainer [2025-02-07 20:12:29,938 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:12:29,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:12:29,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:12:29,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:12:29,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:12:26" (1/3) ... [2025-02-07 20:12:29,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b36a96a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:12:29, skipping insertion in model container [2025-02-07 20:12:29,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:26" (2/3) ... [2025-02-07 20:12:29,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b36a96a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:12:29, skipping insertion in model container [2025-02-07 20:12:29,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:12:29" (3/3) ... [2025-02-07 20:12:29,948 INFO L128 eAbstractionObserver]: Analyzing ICFG ludcmp.c [2025-02-07 20:12:29,961 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:12:29,962 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ludcmp.c that has 1 procedures, 21 locations, 1 initial locations, 11 loop locations, and 1 error locations. [2025-02-07 20:12:30,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:12:30,023 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;@2572dcf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:12:30,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:12:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:12:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-07 20:12:30,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:12:30,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-07 20:12:30,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:12:30,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:12:30,037 INFO L85 PathProgramCache]: Analyzing trace with hash 78217197, now seen corresponding path program 1 times [2025-02-07 20:12:30,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:12:30,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624925748] [2025-02-07 20:12:30,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:12:30,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:12:30,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-07 20:12:30,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-07 20:12:30,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:12:30,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:12:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:12:31,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:12:31,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624925748] [2025-02-07 20:12:31,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624925748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:12:31,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:12:31,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:12:31,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745958884] [2025-02-07 20:12:31,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:12:31,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:12:31,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:12:31,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:12:31,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:12:31,465 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:12:31,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:12:31,631 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2025-02-07 20:12:31,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:12:31,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-07 20:12:31,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:12:31,639 INFO L225 Difference]: With dead ends: 28 [2025-02-07 20:12:31,639 INFO L226 Difference]: Without dead ends: 11 [2025-02-07 20:12:31,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:12:31,643 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:12:31,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 59 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:12:31,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-07 20:12:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2025-02-07 20:12:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:12:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-02-07 20:12:31,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2025-02-07 20:12:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:12:31,672 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-02-07 20:12:31,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:12:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2025-02-07 20:12:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 20:12:31,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:12:31,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:12:31,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:12:31,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:12:31,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:12:31,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1880350436, now seen corresponding path program 1 times [2025-02-07 20:12:31,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:12:31,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108409615] [2025-02-07 20:12:31,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:12:31,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:12:31,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 20:12:31,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 20:12:31,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:12:31,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:12:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:12:32,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:12:32,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108409615] [2025-02-07 20:12:32,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108409615] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:12:32,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286192444] [2025-02-07 20:12:32,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:12:32,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:12:32,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:12:32,603 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-02-07 20:12:32,606 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-02-07 20:12:32,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 20:12:33,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 20:12:33,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:12:33,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:12:33,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 5289 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 20:12:33,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:12:33,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:12:33,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:12:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:12:33,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286192444] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:12:33,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:12:33,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-07 20:12:33,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930373842] [2025-02-07 20:12:33,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:12:33,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 20:12:33,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:12:33,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 20:12:33,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:12:33,776 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:12:33,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:12:33,944 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2025-02-07 20:12:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:12:33,946 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-07 20:12:33,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:12:33,947 INFO L225 Difference]: With dead ends: 21 [2025-02-07 20:12:33,947 INFO L226 Difference]: Without dead ends: 18 [2025-02-07 20:12:33,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:12:33,948 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 43 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:12:33,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 9 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:12:33,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-07 20:12:33,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-07 20:12:33,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:12:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-02-07 20:12:33,954 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 8 [2025-02-07 20:12:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:12:33,955 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-02-07 20:12:33,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:12:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-02-07 20:12:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-07 20:12:33,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:12:33,957 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-02-07 20:12:33,984 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-02-07 20:12:34,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:12:34,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:12:34,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:12:34,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1969732819, now seen corresponding path program 2 times [2025-02-07 20:12:34,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:12:34,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314783784] [2025-02-07 20:12:34,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:12:34,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:12:34,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-07 20:12:34,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:12:34,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:12:34,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:12:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 20:12:34,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:12:34,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314783784] [2025-02-07 20:12:34,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314783784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:12:34,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:12:34,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:12:34,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150537026] [2025-02-07 20:12:34,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:12:34,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:12:34,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:12:34,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:12:34,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:12:34,781 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:12:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:12:34,899 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2025-02-07 20:12:34,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:12:34,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-07 20:12:34,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:12:34,900 INFO L225 Difference]: With dead ends: 43 [2025-02-07 20:12:34,900 INFO L226 Difference]: Without dead ends: 32 [2025-02-07 20:12:34,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:12:34,901 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:12:34,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:12:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-07 20:12:34,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-02-07 20:12:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:12:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-02-07 20:12:34,906 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 17 [2025-02-07 20:12:34,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:12:34,906 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-02-07 20:12:34,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:12:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-02-07 20:12:34,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-07 20:12:34,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:12:34,907 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1] [2025-02-07 20:12:34,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:12:34,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:12:34,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:12:34,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2022950322, now seen corresponding path program 1 times [2025-02-07 20:12:34,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:12:34,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729339367] [2025-02-07 20:12:34,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:12:34,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:12:34,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 20:12:35,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:12:35,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:12:35,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:12:35,745 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:12:35,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:12:35,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729339367] [2025-02-07 20:12:35,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729339367] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:12:35,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610906480] [2025-02-07 20:12:35,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:12:35,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:12:35,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:12:35,748 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-02-07 20:12:35,750 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-02-07 20:12:35,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 20:12:36,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:12:36,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:12:36,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:12:36,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 5325 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 20:12:36,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:12:36,759 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:12:36,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:12:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:12:36,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610906480] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:12:36,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:12:36,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-02-07 20:12:36,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591695126] [2025-02-07 20:12:36,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:12:36,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-07 20:12:36,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:12:36,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-07 20:12:36,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=232, Unknown=0, NotChecked=0, Total=380 [2025-02-07 20:12:36,860 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 20 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:12:37,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:12:37,049 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2025-02-07 20:12:37,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 20:12:37,050 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-07 20:12:37,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:12:37,050 INFO L225 Difference]: With dead ends: 44 [2025-02-07 20:12:37,050 INFO L226 Difference]: Without dead ends: 41 [2025-02-07 20:12:37,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2025-02-07 20:12:37,051 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 33 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 15 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.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:12:37,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 15 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:12:37,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-07 20:12:37,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-07 20:12:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:12:37,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2025-02-07 20:12:37,062 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 17 [2025-02-07 20:12:37,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:12:37,063 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-02-07 20:12:37,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:12:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2025-02-07 20:12:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:12:37,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:12:37,064 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1] [2025-02-07 20:12:37,083 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-02-07 20:12:37,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:12:37,265 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:12:37,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:12:37,266 INFO L85 PathProgramCache]: Analyzing trace with hash 304754574, now seen corresponding path program 2 times [2025-02-07 20:12:37,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:12:37,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778397690] [2025-02-07 20:12:37,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:12:37,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:12:37,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-07 20:12:37,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:12:37,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:12:37,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:12:37,505 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 20:12:37,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:12:37,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:12:37,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:12:37,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:12:37,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 20:12:37,721 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 20:12:37,722 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 20:12:37,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 20:12:37,728 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2025-02-07 20:12:37,825 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:12:37,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:12:37 BoogieIcfgContainer [2025-02-07 20:12:37,829 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:12:37,830 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:12:37,830 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:12:37,830 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:12:37,831 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:12:29" (3/4) ... [2025-02-07 20:12:37,833 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 20:12:37,833 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:12:37,835 INFO L158 Benchmark]: Toolchain (without parser) took 11716.73ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 134.8MB in the beginning and 103.6MB in the end (delta: 31.2MB). Peak memory consumption was 211.2MB. Max. memory is 16.1GB. [2025-02-07 20:12:37,835 INFO L158 Benchmark]: CDTParser took 0.83ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:12:37,836 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.43ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 90.8MB in the end (delta: 43.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-07 20:12:37,836 INFO L158 Benchmark]: Boogie Procedure Inliner took 176.76ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 68.5MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 20:12:37,836 INFO L158 Benchmark]: Boogie Preprocessor took 229.79ms. Allocated memory is still 167.8MB. Free memory was 68.5MB in the beginning and 50.3MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:12:37,837 INFO L158 Benchmark]: IcfgBuilder took 2878.39ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 50.3MB in the beginning and 99.4MB in the end (delta: -49.1MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. [2025-02-07 20:12:37,837 INFO L158 Benchmark]: TraceAbstraction took 7888.15ms. Allocated memory was 218.1MB in the beginning and 352.3MB in the end (delta: 134.2MB). Free memory was 97.8MB in the beginning and 103.7MB in the end (delta: -5.9MB). Peak memory consumption was 129.0MB. Max. memory is 16.1GB. [2025-02-07 20:12:37,838 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 352.3MB. Free memory was 103.7MB in the beginning and 103.6MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:12:37,839 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.83ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 532.43ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 90.8MB in the end (delta: 43.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 176.76ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 68.5MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 229.79ms. Allocated memory is still 167.8MB. Free memory was 68.5MB in the beginning and 50.3MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 2878.39ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 50.3MB in the beginning and 99.4MB in the end (delta: -49.1MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7888.15ms. Allocated memory was 218.1MB in the beginning and 352.3MB in the end (delta: 134.2MB). Free memory was 97.8MB in the beginning and 103.7MB in the end (delta: -5.9MB). Peak memory consumption was 129.0MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 352.3MB. Free memory was 103.7MB in the beginning and 103.6MB in the end (delta: 44.9kB). 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: 7]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 99, overapproximation of someBinaryArithmeticDOUBLEoperation at line 100, overapproximation of to_real at line 98. Possible FailurePath: [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L71] double a[50][50], b[50], x[50]; [L88] int i, j, nmax = 50, n = 5, chkerr; [L89] double eps, w; [L91] eps = 1.0e-6 [L93] i = 0 VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, n=5, nmax=50, x={6:0}] [L93] COND TRUE i <= n [L95] w = 0.0 [L96] j = 0 VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=0, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, x={6:0}] [L99] COND TRUE i == j [L99] EXPR a[i][j] [L99] a[i][j] *= 10.0 VAL [a={4:0}, b={5:0}, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=1, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=2, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=3, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=4, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=5, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=6, n=5, nmax=50, x={6:0}] [L96] COND FALSE !(j <= n) [L102] CALL __VERIFIER_assert(i==2) [L6] COND TRUE !(cond) VAL [a={4:0}, b={5:0}, x={6:0}] [L7] reach_error() VAL [a={4:0}, b={5:0}, x={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 85 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 118 IncrementalHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 34 mSDtfsCounter, 118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 95 NumberOfCodeBlocks, 95 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10614 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 22/91 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-02-07 20:12:37,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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/loops/ludcmp.c -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 45bf8892eb23096ca55c36a274511a87f80900e96066e62793920cbba0252ec0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:12:40,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:12:40,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-07 20:12:40,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:12:40,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:12:40,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:12:40,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:12:40,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:12:40,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:12:40,312 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:12:40,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:12:40,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:12:40,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:12:40,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:12:40,313 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:12:40,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:12:40,313 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:12:40,313 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:12:40,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:12:40,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:12:40,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:12:40,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:12:40,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:12:40,313 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 20:12:40,313 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 20:12:40,314 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 20:12:40,314 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:12:40,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:12:40,314 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:12:40,314 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:12:40,314 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:12:40,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:12:40,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:12:40,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:12:40,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:12:40,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:12:40,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:12:40,314 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:12:40,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:12:40,315 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 20:12:40,315 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 20:12:40,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:12:40,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:12:40,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:12:40,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:12:40,315 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 -> 45bf8892eb23096ca55c36a274511a87f80900e96066e62793920cbba0252ec0 [2025-02-07 20:12:40,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:12:40,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:12:40,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:12:40,644 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:12:40,647 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:12:40,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/ludcmp.c [2025-02-07 20:12:41,929 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59265ddb2/111266ee24fb4655994c42cc74cdebf8/FLAGaaf29a2e3 [2025-02-07 20:12:42,170 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:12:42,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/ludcmp.c [2025-02-07 20:12:42,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59265ddb2/111266ee24fb4655994c42cc74cdebf8/FLAGaaf29a2e3 [2025-02-07 20:12:42,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59265ddb2/111266ee24fb4655994c42cc74cdebf8 [2025-02-07 20:12:42,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:12:42,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:12:42,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:12:42,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:12:42,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:12:42,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:12:42" (1/1) ... [2025-02-07 20:12:42,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d74c5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:42, skipping insertion in model container [2025-02-07 20:12:42,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:12:42" (1/1) ... [2025-02-07 20:12:42,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:12:42,372 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/loops/ludcmp.c[318,331] [2025-02-07 20:12:42,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:12:42,600 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:12:42,610 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/loops/ludcmp.c[318,331] [2025-02-07 20:12:42,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:12:42,905 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:12:42,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:42 WrapperNode [2025-02-07 20:12:42,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:12:42,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:12:42,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:12:42,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:12:42,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:42" (1/1) ... [2025-02-07 20:12:42,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:42" (1/1) ... [2025-02-07 20:12:43,160 INFO L138 Inliner]: procedures = 19, calls = 2647, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 2778 [2025-02-07 20:12:43,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:12:43,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:12:43,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:12:43,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:12:43,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:42" (1/1) ... [2025-02-07 20:12:43,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:42" (1/1) ... [2025-02-07 20:12:43,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:42" (1/1) ... [2025-02-07 20:12:43,256 INFO L175 MemorySlicer]: Split 2631 memory accesses to 5 slices as follows [2, 2518, 5, 53, 53]. 96 percent of accesses are in the largest equivalence class. The 2602 initializations are split as follows [2, 2500, 0, 50, 50]. The 9 writes are split as follows [0, 4, 2, 1, 2]. [2025-02-07 20:12:43,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:42" (1/1) ... [2025-02-07 20:12:43,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:42" (1/1) ... [2025-02-07 20:12:43,398 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:42" (1/1) ... [2025-02-07 20:12:43,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:42" (1/1) ... [2025-02-07 20:12:43,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:42" (1/1) ... [2025-02-07 20:12:43,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:42" (1/1) ... [2025-02-07 20:12:43,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:12:43,448 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:12:43,449 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:12:43,449 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:12:43,450 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:42" (1/1) ... [2025-02-07 20:12:43,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:12:43,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:12:43,488 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-02-07 20:12:43,492 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-02-07 20:12:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:12:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-07 20:12:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-07 20:12:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-02-07 20:12:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-02-07 20:12:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-02-07 20:12:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-07 20:12:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-07 20:12:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-07 20:12:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-02-07 20:12:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-02-07 20:12:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 20:12:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 20:12:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-07 20:12:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-07 20:12:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-07 20:12:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 20:12:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-07 20:12:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-07 20:12:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-02-07 20:12:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-02-07 20:12:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-02-07 20:12:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:12:43,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:12:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:12:43,665 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:12:43,666 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:13:14,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: assume 0bv32 != ludcmp_~i~1#1;ludcmp_~k~0#1 := 0bv32; [2025-02-07 20:13:14,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: assume !(0bv32 != ludcmp_~i~1#1); [2025-02-07 20:13:14,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-1: assume ~fp.leq~64(ludcmp_#t~ret10#1, ludcmp_~eps#1);havoc ludcmp_#t~mem9#1;havoc ludcmp_#t~ret10#1;ludcmp_#res#1 := 1bv32;call ULTIMATE.dealloc(ludcmp_~#y~0#1.base, ludcmp_~#y~0#1.offset);havoc ludcmp_~#y~0#1.base, ludcmp_~#y~0#1.offset; [2025-02-07 20:13:14,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-1: assume !~fp.leq~64(ludcmp_#t~ret10#1, ludcmp_~eps#1);havoc ludcmp_#t~mem9#1;havoc ludcmp_#t~ret10#1;ludcmp_~j~1#1 := ~bvadd~32(1bv32, ludcmp_~i~1#1); [2025-02-07 20:13:14,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-2: ludcmp_#t~ret10#1 := fabs_#res#1;havoc fabs_~n#1, fabs_~f~0#1;havoc fabs_#in~n#1;assume { :end_inline_fabs } true; [2025-02-07 20:13:14,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;call write~intFLOATTYPE8#3(main_~w~0#1, ~#b~0.base, ~bvadd~32(~#b~0.offset, ~bvmul~32(8bv32, main_~i~0#1)), 8bv32);main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := ~bvadd~32(1bv32, main_#t~post7#1);havoc main_#t~post7#1; [2025-02-07 20:13:14,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: assume ~bvsle~32(ludcmp_~j~1#1, ludcmp_~n#1);call ludcmp_#t~mem17#1 := read~intFLOATTYPE8#1(~#a~0.base, ~bvadd~32(~bvadd~32(~#a~0.offset, ~bvmul~32(400bv32, ~bvadd~32(1bv32, ludcmp_~i~1#1))), ~bvmul~32(8bv32, ludcmp_~j~1#1)), 8bv32);ludcmp_~w~1#1 := ludcmp_#t~mem17#1;havoc ludcmp_#t~mem17#1;ludcmp_~k~0#1 := 0bv32; [2025-02-07 20:13:14,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: assume !~bvsle~32(ludcmp_~j~1#1, ludcmp_~n#1);ludcmp_#t~post22#1 := ludcmp_~i~1#1;ludcmp_~i~1#1 := ~bvadd~32(1bv32, ludcmp_#t~post22#1);havoc ludcmp_#t~post22#1; [2025-02-07 20:13:14,868 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: call ludcmp_#t~mem15#1 := read~intFLOATTYPE8#1(~#a~0.base, ~bvadd~32(~bvadd~32(~#a~0.offset, ~bvmul~32(400bv32, ludcmp_~i~1#1)), ~bvmul~32(8bv32, ludcmp_~i~1#1)), 8bv32);call write~intFLOATTYPE8#1(~fp.div~64(currentRoundingMode, ludcmp_~w~1#1, ludcmp_#t~mem15#1), ~#a~0.base, ~bvadd~32(~bvadd~32(~#a~0.offset, ~bvmul~32(400bv32, ludcmp_~j~1#1)), ~bvmul~32(8bv32, ludcmp_~i~1#1)), 8bv32);havoc ludcmp_#t~mem15#1;ludcmp_#t~post16#1 := ludcmp_~j~1#1;ludcmp_~j~1#1 := ~bvadd~32(1bv32, ludcmp_#t~post16#1);havoc ludcmp_#t~post16#1; [2025-02-07 20:13:14,868 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: assume ~bvslt~32(ludcmp_~k~0#1, ludcmp_~i~1#1);call ludcmp_#t~mem12#1 := read~intFLOATTYPE8#1(~#a~0.base, ~bvadd~32(~bvadd~32(~#a~0.offset, ~bvmul~32(400bv32, ludcmp_~j~1#1)), ~bvmul~32(8bv32, ludcmp_~k~0#1)), 8bv32);call ludcmp_#t~mem13#1 := read~intFLOATTYPE8#1(~#a~0.base, ~bvadd~32(~bvadd~32(~#a~0.offset, ~bvmul~32(400bv32, ludcmp_~k~0#1)), ~bvmul~32(8bv32, ludcmp_~i~1#1)), 8bv32);ludcmp_~w~1#1 := ~fp.sub~64(currentRoundingMode, ludcmp_~w~1#1, ~fp.mul~64(currentRoundingMode, ludcmp_#t~mem12#1, ludcmp_#t~mem13#1));ludcmp_#t~post14#1 := ludcmp_~k~0#1;ludcmp_~k~0#1 := ~bvadd~32(1bv32, ludcmp_#t~post14#1);havoc ludcmp_#t~post14#1; [2025-02-07 20:13:14,868 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: assume !~bvslt~32(ludcmp_~k~0#1, ludcmp_~i~1#1); [2025-02-07 20:13:14,868 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: assume ~bvsle~32(ludcmp_~j~1#1, ludcmp_~n#1);call ludcmp_#t~mem11#1 := read~intFLOATTYPE8#1(~#a~0.base, ~bvadd~32(~bvadd~32(~#a~0.offset, ~bvmul~32(400bv32, ludcmp_~j~1#1)), ~bvmul~32(8bv32, ludcmp_~i~1#1)), 8bv32);ludcmp_~w~1#1 := ludcmp_#t~mem11#1;havoc ludcmp_#t~mem11#1; [2025-02-07 20:13:14,868 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: assume !~bvsle~32(ludcmp_~j~1#1, ludcmp_~n#1);ludcmp_~j~1#1 := ~bvadd~32(1bv32, ludcmp_~i~1#1); [2025-02-07 20:13:14,868 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: call ULTIMATE.dealloc(ludcmp_~#y~0#1.base, ludcmp_~#y~0#1.offset);havoc ludcmp_~#y~0#1.base, ludcmp_~#y~0#1.offset; [2025-02-07 20:13:14,868 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132: assume ~bvsle~32(ludcmp_~k~0#1, ludcmp_~i~1#1);call ludcmp_#t~mem18#1 := read~intFLOATTYPE8#1(~#a~0.base, ~bvadd~32(~bvadd~32(~#a~0.offset, ~bvmul~32(400bv32, ~bvadd~32(1bv32, ludcmp_~i~1#1))), ~bvmul~32(8bv32, ludcmp_~k~0#1)), 8bv32);call ludcmp_#t~mem19#1 := read~intFLOATTYPE8#1(~#a~0.base, ~bvadd~32(~bvadd~32(~#a~0.offset, ~bvmul~32(400bv32, ludcmp_~k~0#1)), ~bvmul~32(8bv32, ludcmp_~j~1#1)), 8bv32);ludcmp_~w~1#1 := ~fp.sub~64(currentRoundingMode, ludcmp_~w~1#1, ~fp.mul~64(currentRoundingMode, ludcmp_#t~mem18#1, ludcmp_#t~mem19#1));ludcmp_#t~post20#1 := ludcmp_~k~0#1;ludcmp_~k~0#1 := ~bvadd~32(1bv32, ludcmp_#t~post20#1);havoc ludcmp_#t~post20#1; [2025-02-07 20:13:14,869 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132: assume !~bvsle~32(ludcmp_~k~0#1, ludcmp_~i~1#1);call write~intFLOATTYPE8#1(ludcmp_~w~1#1, ~#a~0.base, ~bvadd~32(~bvadd~32(~#a~0.offset, ~bvmul~32(400bv32, ~bvadd~32(1bv32, ludcmp_~i~1#1))), ~bvmul~32(8bv32, ludcmp_~j~1#1)), 8bv32);ludcmp_#t~post21#1 := ludcmp_~j~1#1;ludcmp_~j~1#1 := ~bvadd~32(1bv32, ludcmp_#t~post21#1);havoc ludcmp_#t~post21#1; [2025-02-07 20:13:14,876 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2025-02-07 20:13:14,877 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:13:14,884 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:13:14,885 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:13:14,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:13:14 BoogieIcfgContainer [2025-02-07 20:13:14,885 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:13:14,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:13:14,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:13:14,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:13:14,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:12:42" (1/3) ... [2025-02-07 20:13:14,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419c6437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:13:14, skipping insertion in model container [2025-02-07 20:13:14,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:12:42" (2/3) ... [2025-02-07 20:13:14,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419c6437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:13:14, skipping insertion in model container [2025-02-07 20:13:14,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:13:14" (3/3) ... [2025-02-07 20:13:14,894 INFO L128 eAbstractionObserver]: Analyzing ICFG ludcmp.c [2025-02-07 20:13:14,907 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:13:14,909 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ludcmp.c that has 1 procedures, 21 locations, 1 initial locations, 11 loop locations, and 1 error locations. [2025-02-07 20:13:14,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:13:14,970 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;@2b64e973, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:13:14,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:13:14,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:13:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-07 20:13:14,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:13:14,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-07 20:13:14,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:13:14,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:13:14,986 INFO L85 PathProgramCache]: Analyzing trace with hash 78217197, now seen corresponding path program 1 times [2025-02-07 20:13:15,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:13:15,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21948956] [2025-02-07 20:13:15,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:13:15,028 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-02-07 20:13:15,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 20:13:15,032 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-02-07 20:13:15,085 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-02-07 20:13:16,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-07 20:13:27,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-07 20:13:27,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:13:27,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:13:28,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 7837 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 20:13:28,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:13:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:13:28,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:13:28,638 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 20:13:28,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21948956] [2025-02-07 20:13:28,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21948956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:13:28,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:13:28,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:13:28,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600252175] [2025-02-07 20:13:28,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:13:28,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:13:28,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 20:13:28,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:13:28,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:13:28,666 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:13:31,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 20:13:32,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:13:32,298 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2025-02-07 20:13:32,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:13:32,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-07 20:13:32,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:13:32,305 INFO L225 Difference]: With dead ends: 28 [2025-02-07 20:13:32,305 INFO L226 Difference]: Without dead ends: 11 [2025-02-07 20:13:32,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:13:32,310 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-07 20:13:32,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 59 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-02-07 20:13:32,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-07 20:13:32,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2025-02-07 20:13:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:13:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-02-07 20:13:32,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2025-02-07 20:13:32,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:13:32,336 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-02-07 20:13:32,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:13:32,337 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2025-02-07 20:13:32,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 20:13:32,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:13:32,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:13:32,538 WARN L435 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)] Forcibly destroying the process [2025-02-07 20:13:32,739 FATAL L548 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)] Could not destroy process within 200 ms, abandoning it [2025-02-07 20:13:32,739 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-02-07 20:13:32,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:13:32,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:13:32,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1880350436, now seen corresponding path program 1 times [2025-02-07 20:13:32,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:13:32,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762226283] [2025-02-07 20:13:32,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:13:32,753 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-02-07 20:13:32,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 20:13:32,756 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-02-07 20:13:32,759 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-02-07 20:13:33,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 20:13:45,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 20:13:45,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:13:45,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:13:46,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 7852 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 20:13:46,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:13:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:13:46,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:13:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:13:47,016 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 20:13:47,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762226283] [2025-02-07 20:13:47,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762226283] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:13:47,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:13:47,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-02-07 20:13:47,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599326232] [2025-02-07 20:13:47,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:13:47,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:13:47,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 20:13:47,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:13:47,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:13:47,018 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:13:49,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []